Cryptographic device and method

ABSTRACT

Some embodiments are directed to an electronic cryptographic device arranged to perform a cryptographic operation on input data obtaining output data. The cryptographic device stores an internal state as sets of shares. Fourier coefficients corresponding to the sets of shares satisfy a predetermined relationship among them. The cryptographic operation is performed by repeatedly updating the internal state.

CROSS-REFERENCE TO PRIOR APPLICATIONS

This application is the U.S. National Phase application under 35 U.S.C. § 371 of International Application No. PCT/EP2018/062830, filed on May 17, 2018, which claims the benefit of European Patent Application No. 17184028.3, filed on Jul. 31, 2017. These applications are hereby incorporated by reference herein.

FIELD OF THE INVENTION

The invention relates to a cryptographic device, a cryptographic method and a computer readable medium.

BACKGROUND

A cryptographic primitive is called secure in the black-box model, if an attacker who only has knowledge of the inputs and outputs of the primitive cannot elevate his rights, e.g., obtain secret keys, encrypt messages, decrypt messages, etc. However, in practice attackers often do not operate in the black-box model, and in fact have more information than just the inputs and outputs. For example, in the grey-box model, it is assumed that an attacker has access to some information related to the execution of the primitive. These additional sources of information are called ‘side-channels’. For example, side-channels include the amount of time that an operation took, or the amount of power that was consumed, etc. In an even stronger model, the so-called white-box model, and attacker has full access to all internal variables of the primitive. Attackers may also modify variables, even as the program is running. Even so, the white-box implementation aims to prevent the extraction of secret keys from the program.

Implementations that resist white-box attacks, are sometimes implemented as an encoded table network operating on encoded data. In the paper “White-Box Cryptography and an AES Implementation” by S. Chow, et al. a white-box implementation of the block cipher AES (Advanced Encryption Standard) is presented (referred to as ‘Chow’ below and incorporated by reference herein). Chow forms an implementation of AES that consists entirely of table look-up operations. Through several intermediate methods, the normal cipher is transformed to an implementation in this form, so that a table-network can be used to compute AES. By encoding the tables in the table-network, the system's resistance against analysis and attack is increased. The techniques used in Chow can be applied to other block ciphers as well.

Although a white-box implementation using a table-network is hard to analyze, a table based implementation of block cipher may still be vulnerable to some attacks. Interestingly, attacks developed in the context of the grey-box model can sometimes be effective against white-box implementations as well. Accordingly, avoiding attacks under the grey-box model can be an effective countermeasure in the white-box model too. An example of such attacks can be found in the paper “Differential Computation Analysis: Hiding your White-Box Designs is Not Enough.”, by Joppe W. Bos, et al.

There is a need to better protect computer implementations of cryptographic primitives against attacks; in particular, a better protection against grey box type attacks applied to white-box implementations.

Reference is hereby made to the published PCT patent application WO 2017/063986 A1 (“A Cryptographic Device and an Encoding Device”).

SUMMARY OF THE INVENTION

An improved cryptographic device is presented which addresses these and other concerns.

The cryptographic device is an electronic device. For example, the device may be a mobile electronic device, e.g., a mobile phone. The electronic device may be a set-top box, smart-card, computer, etc. The cryptographic device and/or the cryptographic method described herein may be applied in a wide range of practical applications. Such practical applications include: security, cryptography, content protection, copy protection, financial applications, privacy protection, communication applications, etc.

A method according to the invention may be implemented on a computer as a computer implemented method, or in dedicated hardware, or in a combination of both. Executable code for a method according to the invention may be stored on a computer program product. Examples of computer program products include memory devices, optical storage devices, integrated circuits, servers, online software, etc. Preferably, the computer program product comprises non-transitory program code stored on a computer readable medium for performing a method according to the invention when said program product is executed on a computer.

In a preferred embodiment, the computer program comprises computer program code adapted to perform all the steps of a method according to the invention when the computer program is run on a computer. Preferably, the computer program is embodied on a computer readable medium.

Another aspect of the invention provides a method of making the computer program available for downloading. This aspect is used when the computer program is uploaded into, e.g., Apple's App Store, Google's Play Store, or Microsoft's Windows Store, and when the computer program is available for downloading from such a store.

BRIEF DESCRIPTION OF THE DRAWINGS

Further details, aspects, and embodiments of the invention will be described, by way of example only, with reference to the drawings. Elements in the figures are illustrated for simplicity and clarity and have not necessarily been drawn to scale. In the Figures, elements which correspond to elements already described may have the same reference numerals. In the drawings,

FIG. 1 schematically shows an example of an embodiment of a cryptographic device,

FIG. 2 schematically shows an example of an embodiment of updating an internal state,

FIG. 3a schematically shows an example of an embodiment of a representation of an internal state,

FIG. 3b schematically shows an example of an embodiment of a representation of an internal state,

FIG. 4a schematically shows an example of the sets of Fourier coefficients corresponding to an embodiment of a representation of an internal state,

FIG. 4b schematically shows an example of the sets of Fourier coefficients corresponding to an embodiment of a representation of an internal state,

FIG. 4c schematically shows an example of the sets of Fourier coefficients corresponding to an embodiment of a representation of an internal state,

FIG. 4d schematically shows an example of the sets of Fourier coefficients corresponding to an embodiment of a representation of an internal state,

FIG. 4e schematically shows an example of the sets of Fourier coefficients corresponding to an embodiment of a representation of an internal state,

FIG. 5a schematically shows an example of an embodiment of a cryptographic method,

FIG. 5b schematically shows an example of an embodiment of a cryptographic method,

FIG. 6a schematically shows a computer readable medium having a writable part comprising a computer program according to an embodiment,

FIG. 6b schematically shows a representation of a processor system according to an embodiment.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

While this invention is susceptible of embodiment in many different forms, there are shown in the drawings and will herein be described in detail one or more specific embodiments, with the understanding that the present disclosure is to be considered as exemplary of the principles of the invention and not intended to limit the invention to the specific embodiments shown and described.

In the following, for the sake of understanding, elements of embodiments are described in operation. However, it will be apparent that the respective elements are arranged to perform the functions being described as performed by them.

Further, the invention is not limited to the embodiments, and the invention lies in each and every novel feature or combination of features described herein or recited in mutually different dependent claims.

Embodiments of the invention allow implementations of cryptographic primitives, such as block cipher, e.g., the AES algorithm that offer a high resilience against a large class of key-recovery attacks, including the white-box generalizations of known side channel attacks, as well as a number of pure white-box attacks. It is noted that implementations according to the invention have increased security not just in the white-box model, but also in the grey box model.

To introduce the invention first a number of attacks on white-box implementations are described. Throughout the document the focus is on the block cipher AES. AES is an important, much-used, cryptographic primitive. However, it is stressed that techniques below can be applied to other cryptographic primitives as well. For example, other block ciphers may be implemented as embodiments. Especially block ciphers of SLT design (Substitution/Linear transformation block ciphers, sometimes referred to as Substitution-permutation network (SPN) block ciphers), such as AES (Rijndael), 3-Way, Kuznyechik, PRESENT, SAFER, SHARK, and Square, can be adapted with little effort. The cryptographic primitive may be a symmetric primitive, e.g., wherein an encrypting/decrypting key is the same, or a signing/verification key. The cryptographic primitive may also be key-less, such as a hash functions. Protecting hash functions may be important, as they may be applied to secret data. In fact, hash functions may be part of a keyed design, such as if the hash function is used in HMAC.

The Advanced Encryption Standard (AES) is described in Advanced Encryption Standard, Federal Information Processing Standards Publication 197, 2001. Below, we outline the major attacks that can be mounted against an implementation of AES, by a ‘white-box’ attacker who has access to the running program and its environment, and who is able to read and modify all program variables that appear in memory.

Apart from the memory scraping attack, which is a pure white-box attack, the major attacks originate from side channel analysis; these ‘grey-box’ attacks can also be applied in a white-box environment.

In a Memory scraping attack, the key is read from the program memory. This is the simplest white box attack. To thwart this attack, the key must never appear ‘in the clear’ in the program memory, but only in some encoded form.

Attacks based on Differential Power Analysis/Differential Computation Analysis/Mutual Information Analysis/Collisions, etc., all work on the principle of collisions. A collision occurs when an internal program variable takes on the same value for two different inputs or outputs of the program. When a collision occurs on a variable that depends not only on the program input or output, but also on the key, then the mere fact that a collision occurs, reveals information on the key. Note that, encoding all AES state and key bytes—e.g., choosing a set E of invertible mappings on the set {0,1,K,255} and replacing each state and key byte x by E(x) for some E∈E—does not thwart a collision attack by itself: the encoding E obfuscates the value of byte x, but when a collision occurs on byte x, then it also occurs on the program variable E(x).

In attacks based on Differential Fault Analysis, the attacker runs the program twice on the same input, introduces a fault by changing one or more program variables in one of the runs, and records both outputs. The way in which the two outputs differ may reveal information about the key.

A countermeasure to defend against the latter type of attacks is the masking of variables by using multiple shares to represent them. For example, a variable x can be additively represented by n shares x₀,K,x_(n−1), where n≥2 and x₀⊕x₁⊕Λ⊕x_(n−1)=x. Here addition is the XOR operation. For example, in hardware implementations, one may choose n−1 of the shares randomly and calculate the remaining one such that the n shares represent the variable x. Then a simultaneous collision on any set of k shares, where k<n, does not reveal any information about whether a collision occurs on variable x; only if a simultaneous collision occurs on all n shares, the attacker can infer that a collision occurs on x. An n-th order DPA attack is thus needed to extract the key.

In a white-box environment, the shares have to be encoded: if the attacker can simply sum (e.g., calculate the exclusive-OR of) the shares to recover the variable x or an encoding E(x) of x, he can check whether there is a collision on the variable x represented by shares X by summing the shares. To prevent this attack, the values that appear in the program should be encodings E_(i)(x_(i)) of the shares, where each share x_(i) is encoded using a different encoding E_(i)∈E. Then the sum ⊕_(i=0) ^(n−1)E_(i)(x_(i)) is not related to x. Note that if the counter-measures described herein are applied to increase security only in the grey-box model, and not in the white-box model, separate encryption of each share may not be needed. This in turn may lead to more efficient implementations, e.g., by avoiding table look-up operations which operate on encoded shares.

It was an insight of the inventors that the latter, representing a variable as multiple encoded shares, can still be circumvented by a white-box attacker by introducing faults in two or more shares from the same set X, and checking whether the output of the program changes: if the output does not change, then the two share sets X* and X, with and without the faults, respectively, represent the same byte. In fact, when the shares (ξ₀,K,ξ_(n−1)) with ξ_(i)=E_(i)(x_(i)) represent the byte x, there exists a share set (ξ′,0,0,K,0) in which the last n−1 shares have encoded value 0 and which represents the same value x. So in order to check whether two share sets X and X* represent the same value, the attacker changes X into (ξ,0,K,0) for 0≤ξ<256 and checks for which value of ξ the output is unchanged, he then finds ξ* such that X* and (ξ*,0,K,0) give the same output and he concludes that X and X* represent the same value if and only if ξ=ξ*.

With the above attack added security of using shares is neutralized, and many of the grey-box type attacks, in particular attacks based on finding a collision, can be effectively executed. In an embodiment, this share reduction attack is avoided.

Embodiments make use of the discrete Fourier transform in the finite field. For example, in case data-elements are bytes the finite field may be F₂₅₆, the finite field with 256 elements. In an embodiment, the data-elements are binary words comprising multiple bits; in this case, a finite field with characteristic 2 is appropriate and size 2 to the power of the number of bits. This is not necessary though. One could construct a block cipher operating on words of, e.g., ternary bits, in which case the finite field may have characteristic 3, etc. Below computing with sets of shares is introduced and it is explained how they relate to the Fourier transform.

Representation of data-elements with shares are ideally suited to linear transforms. A linear transform has the property that L(x₀⊕Λ⊕x_(n−1))=⊕_(i=0) ^(n−1)L(x_(i)), so in order to apply L to variable x, L can be applied to each share individually. Note that the shares are typically encoded, so that the operation L(x_(i)) and the summation may be performed by a table look-up. If the encodings of the shares are linear, the operator L can be represented on the shares as a matrix operating on the bits in the shares, e.g., on ‘number of shares’ times ‘number of bits per data element’ bits. Below more elaborate implementations of linear operators are discussed. For example, the shares may be encoded with linear encodings, e.g., random linear encodings so that the encodings can be integrated in the linear operation.

The above computation which works for linear operators does not work for non-linear operators, in particular substitutions boxes, such as the S-box of AES. Interestingly, any non-linear operation on a data element may be represented as a polynomial. For example, a non-linear transformation ƒ on bytes is a polynomial on the finite field F₂₅₆.

${f\text{:}\mspace{14mu} x\;\alpha{\sum\limits_{j = 0}^{255}{f_{j} \cdot x^{j}}}},{{{with}\mspace{14mu} f_{j}} \in {F_{256}.}}$

Here the sum (Σ) is the addition on F₂₅₆, e.g., the exclusive-OR of the bytes, and · stands for the multiplication on F₂₅₆. Non-linear transformations can be applied to shares by means of convolutions. The convolution of two share sets X=(x₀,K,x_(n−1)) and Y=(y₀,K,y_(n−1)) is defined as

${Z = {X*Y}},{{{where}\mspace{14mu} Z} = {{\left( {z_{0},K,z_{n - 1}} \right)\mspace{14mu}{with}\mspace{14mu} z_{i}} = {\underset{j = 0}{\overset{n - 1}{\oplus}}{x_{j} \cdot {y_{i - {j\;{mod}\; n}}.}}}}}$

It holds that z=⊕_(i−0) ^(n−1)z_(i)=x·y: the convolution of the shares is a share representation of the product. It follows that the function ƒ can be implemented on shares as the function XαΣ_(j=0) ²⁵⁵F_(j)*X^(j), where X^(j) is the j-fold convolution of X with itself: X⁰ is a share representation of 1, X¹=X, X²=X*X, X³=X*X*X, etc., and where F_(j) is a share representation of ƒ_(j).

The AES S-box can be written as S=⊕_(S(0))oM ol, where l(x)=x²⁵⁴ is the inverse on F₂₅₆, M is an additive operator on F₂₅₆ and the operation ⊕_(S(0)) adds S(0)=0x63 to its input on F₂₅₆. The additive operator M can be written as an additive polynomial

${{M(x)} = {\sum\limits_{j = 0}^{7}\;{m_{j}x^{2^{j}}}}},$ with m₀=0x05, m₁=0x09, m₂=0xƒ9, m₄=0x25, m₅=0x01, m₆=0xb5, m₇=0x8ƒ.

Below we further discuss the discrete Fourier transform when the number of shares (n) divides the number of elements in the finite field minus 1; e.g. in the case of bytes, n divides 255. Below we discuss the case for bytes, but for other fields the situation is analogous. For an element x∈F₂₅₆\{0}, the order of x, denoted ord(x), is defined as the smallest positive number k such that x^(k)=1. For all x ord(x) divides 255. the number of elements of F₂₅₆\{0}. Let n be a divisor of 255, e.g., n∈{1,3,5,15,17,51,85,255}, and let Ω be an element of order n. The Fourier transform {circumflex over (X)}=({circumflex over (x)}₀,K,{circumflex over (x)}_(n−1)) of X=(x₀,K,x_(n−1))∈F₂₅₆ ^(n) is defined as

${{\hat{x}}_{k} = {\sum\limits_{j = 0}^{n - 1}\;{\Omega^{jk}x_{j}}}},{0 \leq k < {n.}}$

We call the numbers {circumflex over (x)}₀,K,{circumflex over (x)}_(n−1) the Fourier coefficients of the share set X. The inverse Fourier transform is given by

${{\hat{x}}_{j} = {\sum\limits_{j = 0}^{n - 1}\;{\Omega^{- {jk}}{\hat{x}}_{k}}}},{0 \leq j < {n.}}$

Compared to the conventional Fourier transform on C^(n) the overall factor 1/n is missing since F₂₅₆ has characteristic 2 and n is odd. Note that, even though any permutation of a set of shares represents the same data element, for the purpose of the Fourier transform we regard the set as ordered. Likewise, a set of Fourier transforms is ordered. Note that it is unlikely that a permutation of a set of Fourier coefficients still represents the same data element. If a particular Fourier coefficient in a set of Fourier coefficients needs to be identified we refer to its index, e.g., its subscript.

The inventors had the insight that a white-box device could hide cryptographic data in Fourier coefficients. The device would still act on a set of shares, or on multiple sets of shares, but the relevant data would be coded in the set or sets of Fourier coefficients that correspond to the set of shares. This has several consequences. The sets of Fourier coefficients are themselves not directly stored in the device. The Fourier coefficients only become available by computing them from a set of shares. However, since the Fourier transform is linear, the Fourier transform can be hidden efficiently by combining it with the affine operations in the cryptographic algorithm and the encoding of the shares. For example, one could combine: a decoding operation, a Fourier transform, one or more linear operations, an inverse Fourier transform, and an encoding operation, all into one combined linear operation. Furthermore, both affine and non-linear operations can be effectively computed on the Fourier coefficients. As pointed out, the affine operations combine naturally with the linear Fourier transform. Non-linear operations, in particular parallel application of substitution boxes, e.g., in a so-called s-box layer, can be computed by representing the s-box as a polynomial. Using convolutions, polynomials can be effectively computed on Fourier coefficients. In an embodiment, the data size of the Fourier coefficients, e.g., of the elements of set of shares as well as of the set of Fourier coefficients, is equal or larger than the input and output size of the substitution boxes in an s-box layer.

Some conventional encodings, e.g., used in masking, have the problem that the masking is compatible with some operations, but not with others. The non-compatible operations then require vulnerable or costly solutions. However, using the Fourier coefficients all required operations can be efficiently performed.

Using Fourier coefficients may be used to improve resistance against attacks in other ways as well. If an attacker modifies a single data element of a set of shares, e.g., to try to execute a fault attack, multiple of the corresponding Fourier coefficients will be changed. This can be exploited in different ways. For example, one may encode multiple cryptographic data elements in the same set of Fourier coefficients. An attacker who modifies a single data element of the set of shares may thus modify more than one of the cryptographic data elements stored in the set of Fourier coefficients. For fault attacks, an attacker typically desires to change only a single one of the cryptographic data elements, not multiple ones. For example, one can prove mathematically that to modify a single Fourier coefficient, in a set of 17 Fourier coefficients, one needs to modify at least 9 shares of the corresponding set of shares.

Another way to use Fourier coefficients to improve security is to impose restrictions on the Fourier coefficients that are not needed for representing cryptographic data. This can be done within a single set of shares, e.g., by requiring that some of the Fourier coefficients which are used for fault detections satisfy some invariant, e.g., that they have a specific value. This can also be done across multiple sets of shares, e.g., by requiring that some of the Fourier coefficients corresponding to a first set of shares and some of the Fourier coefficients corresponding to a second set together satisfy some invariant; for example, that a Fourier coefficient in a first set is equal to a Fourier coefficient in a second set. The latter helps against share reduction attacks as well.

In an embodiment, a set of Fourier coefficients comprises both representing and non-representing data elements, or error-detecting data elements. Together all sets of Fourier coefficients represent all data elements of the internal state. Error detecting elements are also referred to as protective elements. For example, each one of the sets of Fourier coefficients may have both types. The representing data elements in a set of Fourier coefficients represent one or more cryptographic data elements, e.g., data elements of an internal state. For example, the representing data elements may be equal to the data elements that they represent. For example, the representing data elements may be represented in some other way, for example, there may be an encoding that maps the representing data elements to their counterparts. In particular, there may be an affine mapping from the representing data elements to the elements that they represent, the latter may be the same in number or fewer.

A proper subset of the Fourier coefficients (that is, a subset of the Fourier coefficients that is not equal to the full set of Fourier coefficients, i.e., a strict subset) determines the one or more data elements represented by that set of shares. In other words, from a set of the Fourier coefficients one could uniquely determine the one or more data elements—in fact the proper subset would already suffice. Generally speaking, it may not be possible to uniquely determine the (full) set of the Fourier coefficients from the one or more data elements; in an embodiment, there are multiple sets of the Fourier coefficients and thus multiple sets of shares that all validly represent the same one or more data elements.

The error-detecting data elements are arranged to detect unauthorized changes during the execution of the program, e.g., tampering. For example, the error-detecting data elements comprise redundant data arranged to detect tampering. In an embodiment, the error-detecting data elements may satisfy some predetermined relationship among them. The predetermined relationship may extend across sets of Fourier coefficients (if there are multiple). For example, the predetermined relationship may be a linear relationship that is satisfied by the error-detecting data elements, e.g., that some or all data elements are equal or that some linear sum of error-detecting data elements is equal to some other linear sum of error-detecting data elements, etc. For example, the predetermined relationship may be an affine relationship that is satisfied by the error-detecting data elements, e.g., that some or all data elements are equal to a particular value. The linear or affine operation may include the representing elements, for example, the relationship may require that an affine operation applied to the representing elements and error-detecting elements is the all zero-vector. For example, the latter operation may express that an error-detecting element has a fixed value and/or that an error-detecting element is equal to a representing element. The operations may be configured so that they do not provide useful output anymore, e.g., distorted output, e.g., randomized output, if they receive an input which does not satisfy the expected relationship. In an embodiment, a set of Fourier coefficients, or even all sets of Fourier coefficients comprise both representing elements and protective elements. Some elements in a set of Fourier coefficients may be neither representing nor error-detecting. They may simply be ignored and filled with dummy values.

In an embodiment, a subset of the Fourier coefficients, e.g., of the error-detection elements, are equal to a predetermined value. One may regard this set as a vector with a particular value. The affine operation may be configured to map this subset, e.g., this vector to further vector with a particular value. Likewise, the non-linear operation may also map such a vector from one particular value to another. The vector formed by the error-detection element(s) with a particular value may thus be mapped from round to round having a particular value in each round. The value taken by this vector may be different after each operation, and can be chosen at compile time, e.g., randomly.

Below various embodiments are disclosed of white-box devices using Fourier coefficients to hide data relevant for the execution of the cryptographic algorithm. In a first series of embodiments, the data elements of an internal state of a cryptographic algorithm are each encoded with their own set of shares. So, one may for example have as many sets of shares as there are data elements in the internal state. For example, in the case of AES with an internal state of 16 bytes, and sets of shares of 17 bytes, one may encode the internal states as 16 times 17 bytes. Each set of Fourier coefficients corresponding to a set of shares encodes a single byte of the internal state. In such embodiments, there are many non-representing, e.g., error-detecting, data elements, e.g., 16 bytes for each set of Fourier coefficients. On the error-detecting bytes an invariant may be maintained. As a result, strong detection of unauthorized modifications by attackers is possible as such a modification would likely not preserve the invariant.

It is not necessary to represent only a single data element in a set of Fourier coefficients. One may represent multiple data elements in the same set. For example, further below embodiments are disclosed in which the entire internal state of a cryptographic algorithm is encoded in a single set of Fourier coefficients. Such embodiments have the advantage that overall fewer sets of shares are needed to encode the full internal state, and thus that the encoding of the internal state requires less data. This in turn leads to fewer or smaller tables, and reduced storage requirements. Embodiments may have fewer non-representing data elements in their sets of Fourier coefficients. This will not necessarily lead to a weaker implementation though. Although fewer error-detecting data elements may imply weaker error-detection capabilities, having more data elements, or even an entire internal state represented in a single set of Fourier coefficients increases the likelihood that modifying single element of a set of shares leads to modifying multiple data elements of the internal state, rather than a single data element as is desired in a fault attack. Furthermore, an increase in the number of representing data elements in the Fourier coefficients can be compensated by choosing a larger set. The latter need not lead to an increase of the size of an encoded internal state since fewer sets of shares are needed. For example, a set of shares of size 17 or 51 could each encode a full internal state.

A first example of hiding a data element in a Fourier coefficient can be obtained, when the share representation is used, with the convention that the sum of the shares equals the represented data element, there is an interesting connection with the Fourier transform: The value represented by the share set X is equal to the zeroth Fourier coefficient {circumflex over (x)}₀, so the result above implies that if Z=X*Y, then {circumflex over (z)}₀={circumflex over (x)}₀·ŷ₀. In fact, this relation holds for all Fourier coefficients, not just the zeroth: Z=X*Y⇔{circumflex over (z)} _(k) ={circumflex over (x)} _(k) ·ŷ _(k), 0≤k<n.

This implies that the mapping XαΣ_(j=0) ²⁵⁵F_(j)*X^(j), effectively maps Fourier coefficient {circumflex over (x)}_(k) onto Σ_(j=0) ²⁵⁵({circumflex over (ƒ)}_(j))_(k)({circumflex over (x)}_(k))^(j), where ({circumflex over (ƒ)}_(j))_(k) is the k-th Fourier coefficient of the share set F_(j). In embodiments, this natural mapping between a set of shares representation and the corresponding set of Fourier coefficients is exploited, by using the Fourier coefficient with index 0 to represent the data element and Fourier coefficients with a higher index to protect against attacks. However, this is not at all necessary: any one, e.g., any single one or two or more together, of the Fourier coefficients may represent the data element, with the remaining Fourier coefficients used to protect against attacks. For example, in an embodiment the data value is not determined solely by the zeroth Fourier coefficient, but by one or more different Fourier coefficients, or by the zeroth Fourier coefficient together with one or more different Fourier coefficients.

The inventors realized that the share reduction attack is successful if it is possible to change two or more shares from a share set in such a way that both the value that the share set represents, and the program output remain the same. The fact that the output doesn't change is used by the attacker as a signal that the faults that he injected did not change the value represented by the share set. One way to thwart this attack, is a mechanism to change the output, preferably in a manner that is unpredictable to an attacker, whenever a change is made to a set of shares X, even when that change leaves the value represented by the share set (e.g., the value {circumflex over (x)}₀) the same. The protective elements in the sets of Fourier coefficients can be used to detect if a change was made to a set of shares.

An embodiment, using a single representing element for each set of Fourier coefficients may be described in summary as follows. Suppose we have n shares x=x₀, . . . , x_(n−1) representing a secret x over some finite field

_(q) of order q. Let α∈

_(q) be a primitive n-th root, e.g., n∈

_(q−1) is the smallest power such that α^(n)≡1. Recall that n should divide q−1. The Fourier Transform of x is defined as {circumflex over (x)}, where {circumflex over (x)} _(i)=Σ_(j=0) ^(n−1)α^(i*j) x _(j).

We call {circumflex over (x)}_(i) the i-th Fourier Coefficient of x.

A closer look at block ciphers of the AES type shows that it is constructed as follows: AES=A _(m) ∘S∘A _(m−1) ∘S∘A _(m−2) ∘S∘ . . . ∘S∘A ₀

where A_(i) are round-dependent affine transformations and S the SubBytes layer. In the FIPS 197 definition of the S-box layer (Section 5.1.1), the S-box includes both a non-linear part (the inverse) and an affine part. The latter may be incorporated in the affine operation A_(i) neighboring an s-box. Here A₀ represents the input transformation followed by adding the first round (dummy) key, and A_(m) denotes adding the last round key, followed by the linear output transformation.

Let X=x⁰, . . . , x¹⁵ denote the shared AES state before A_(i). In this embodiment, the choice was made for n=17 shares. So x denotes a vector of size 16*17=272 bytes. The remaining transformations A_(i) may be constructed as follows:

1. Decode (using matrix D_(i))

2. Fourier Transform (using matrix F)

3. Permute, actually putting the 17 Fourier coefficients next to each other (using matrix T), e.g.:

₀,

₀, . . . ,

₀,

₁,

₁, . . . ,

₁₆.

4. Perform round-dependent linear operation (using matrix L_(i))

5. Permute back (using matrix T⁻¹)

6. Invert Fourier Transform (using matrix F⁻¹)

7. Encode (using matrix E_(i+1))

8. Add vector (using vector V_(i))

In an embodiment, steps 1-7 are linear operations that are implemented by matrix multiplications. Thus, given that the encodings are linear, these steps can be implemented by a single matrix multiplication using matrix L′_(i)=E_(i+1)F⁻¹ T ⁻¹ L _(i)TFD_(i).

And the operation A_(i) is defined as A _(i)(X)=V _(i) +L′ _(i)(X).

The vector V_(i) corresponds to the sum of the key and the addition part of the S-box layer. This embodiment provides a non-trivial action on the representing as well as on the non-representing elements. Suppose for the moment that L_(i) is composed as follows: let M denote the linear 16×16 bytes matrix representing the ShiftRows and MixColumns operation. Next let L_(i) be the block diagonal matrix consisting of 17 copies of M in the diagonal:

$\begin{pmatrix} M & \; & 0 \\ \; & \ddots & \; \\ 0 & \; & M \end{pmatrix}.$

It follows that L_(i) actually computes 17 ShiftRows and Mixcolumns in parallel on

_(j),

_(j), . . . ,

_(j) for 0≤j≤16.

Next consider the operation S. The property that each convolution implies a point-wise multiplication on the Fourier Coefficient means that if the squaring is also implemented as a convolution, the inversion operation in S inverts all Fourier Coefficients in parallel. Thus, if the linear part of S and the addition of the constants are chosen to have the same effect on all Fourier Coefficients, it follows that S computes the SubBytes function of all Fourier Coefficients.

Performing non-trivial operations, in this case AES or AES like operations on the non-representing coefficients is considered an advantage, as it will make it harder for an attacker to find where the real AES is taking place. In fact, this embodiment shows that parallel evaluation of 17 AES evaluations is possible. Note that this observation holds for any algorithm that can be represented as an . . . SASASASASA . . . structure.

Furthermore, a convolution computes simultaneously the point-wise product of all the Fourier Coefficients, as opposed to the linear transformation, where one has the freedom to specify what happens which each separate Fourier Coefficient. Each linear operation can be hidden in this matrix. In fact, any two non-linear functions can be written as polynomials and can be evaluated in parallel in different Fourier Coefficients. Indeed, using a convolution network all relevant powers of the inputs can be computed in parallel, while the inner-product with the polynomial coefficients (the only difference between the polynomials) is linear and, hence, can be computed in parallel by a matrix product.

FIG. 1 schematically shows an example of an embodiment of a cryptographic device 100. Device 100 is arranged to perform a cryptographic operation on input data and obtain output data; the output data is the result of applying the cryptographic operation to the input data. In an embodiment, the input data and output data are both plain data. We refer to plain data as data which is not encoded with a secret encoding, e.g., an encoding which is unknown to an attack, e.g., a private encoding, e.g., private to device 100. The cryptographic operation may be an encryption or decryption operation, e.g., symmetric, e.g., a block cipher, e.g., AES, or a signing or verification operation, e.g., symmetric. The latter may be a MAC constructed from a hash function or from a block cipher, e.g., a block cipher running in CBC-MAC mode. Device 100 may be integrated in a device that uses the cryptographic operation for some purpose. For example, device 100 may be arranged to receive encrypted content. Using the cryptographic operation, the content may be decrypted. Because of the nature of a white-box implementation, even if the content is decrypted, it is still hard to obtain the key with which the content is decrypted. For example, device 100 may be arranged to authenticate financial transaction, e.g., by applying a signature or a MAC to a message. For an attacker, it is hard to extract the key with which the operation was done from the device, e.g., from software running on the device.

The execution of the primitive is implemented in a processor circuit, examples of which are shown below. FIG. 1 shows functional units that may be functional units of the processor circuit. For example, FIG. 1 may be used as a blueprint of a possible functional organization of the processor circuit. The processor circuit is not shown separate from the units in FIG. 1. For example, the functional units shown in FIG. 1 may be wholly or partially be implemented in computer instructions that are stored at device 100 and are executable by a microprocessor of device 100. In hybrid embodiments, functional units are implemented partially in hardware, e.g., as coprocessors, e.g., crypto coprocessors, and partially in software stored and executed on device 100.

Device 100 comprises an internal state storage 130. The internal state storage 130 may be implemented as a memory, e.g., an electronic memory. The internal state storage 130 is arranged to store a representation of an internal state. The internal state comprises one or more data elements. Data elements may be binary data elements. For example, the data element may be bytes, nibbles or larger words, e.g., in an embodiment, data elements comprise multiple bits, say at least 4 bits, and have at least 16 different possible values. Typically, all data elements have the same size. The internal state is repeatedly updated. For example, in the case of AES a plain internal state comprises 16 data elements, in this case 16 bytes, for a total of 128 bits. A set of shares representing the internal state may also use bytes for data elements, but will typically have a larger size, e.g., use more than 16 bytes. The data elements of an internal state are not directly stored in internal state storage 130, as is further explained herein.

This is illustrated in FIG. 2. FIG. 2 schematically shows an example of an embodiment of updating an internal state. Shown in FIG. 2 are internal states 211, 212, 213, 214. By applying linear or non-linear operators the internal states are updated. Shown in FIG. 2 is the update from internal state 211 to internal state 212, from internal state 212 to internal state 213. An initial internal state is derived from the input data. In FIG. 2 the input data is represented at 210, and the initial internal state is internal state 211. Likewise, output data 215 is derived from a final internal state 214. Some of the operations on an internal state may be key dependent. Often the input and output data 210, 215 will be plain, e.g., not encoded with a secret encoding. If device 100 is configured for a block cipher encryption the plain output data is nevertheless an encryption of the input data, e.g., plain encrypted data. This is not necessary though. Device 100 may be integrated in a larger cryptographic system, e.g., a Digital Rights Management (DRM) system. In such a system content can only be rendered if it is allowed by a digital right. The data that enters the cryptographic primitive may be data which is the result of or an input to further cryptographic processing or decision taking. These operations may be performed on encoded data as well. In such a case one or both of the input and output data may be encoded and not plain. It will further be assumed the input and output data is unencoded but an embodiment with encoded input/output data may be produced by leaving out the corresponding transformation steps, e.g., encoding and decoding operations.

The internal states are represented in internal state storage 130 in a special manner. FIG. 3a schematically shows an example of an embodiment of a representation of an internal state. FIG. 3a shows a table with different views of the same internal state. Only the lower left box, at 340 shows the actual data as it is physically stored in internal state storage 130, e.g., in a memory. The individual data elements in box 340, e.g., bytes, are dashed to indicate that they are encoded. For example, they may be encoded with some secret, e.g., random encoding chosen at compile time. The right column is the Fourier transform of the left column.

Shown in box 310 is a plain internal state. Shown are data elements, e.g., bytes, 311, 312 and 313 of the internal state. For example, in case of AES the number of bytes may be 16 or more. For example, the internal state 310 may be the ‘state array’ as defined in FIPS 197.

Each data element shown in box 310 may be represented in the memory as a corresponding set of shares. For example, data element 311 corresponds to share set 321, data element 312 corresponds to share set 322 and data element 313 corresponds to share set 323. The relationship between a data element and a share set is one to many. The data size of a share set is a multiple of the size of a data element. For example, a share set may comprise multiple shares, each of which have the same size as the data elements, e.g., they may both be bytes.

The share sets shown in box 320 are not encoded. Thus, if these shares set were used like this in a white-box implementation, an attacker could simply read the shares from memory and map them to the correct data element.

In box 330, discrete Fourier transforms of the share sets in 320 are shown. Shown are sets of Fourier coefficients 331, 332 and 333. For example, set of Fourier coefficients 331 may be obtained by applying a discrete Fourier transform in a finite field to share set 321. The sets of Fourier coefficients in box 330 are not encoded either, and cannot be stored in a memory in this way either in a white-box implementation. Box 340 shows the internal state represented as sets of encoded shares. The data in box 340 may be obtained from box 320 by encoding each share in each set separately. For example, by encoding the first share in set 321 one may obtain the first share in set 341, etc. In an embodiment, only the data shown in box 340 may be directly visible, e.g., may be physically stored in the memory.

Interestingly, encoding is done in the shares domain, whereas the meaning of a share set is expressed in the Fourier domain. Shares are separately encoded which normally obstructs performing most operations on them. However, the Fourier coefficients are a global property determined by the entire share set; through the relationship between the Fourier transform and convolution the meaning of the share sets can be manipulated even though they are separately encoded.

A set of shares in box 320 or 340 represents a data element of the internal state. Which data element is represented, depends on the Fourier coefficients. In the embodiment shown in FIG. 3a , one of the Fourier coefficients for each of the set of Fourier coefficients in box 330 is chosen as the data element it represents. The representing Fourier coefficient has been indicated by diagonal hatching. Non-representing Fourier coefficients are indicated as clear. In this example, there is exactly one representing Fourier coefficient for each set of Fourier coefficients. For example, the representing coefficients in sets 330 may be equal to the data elements in internal state 310.

For example, one may choose a predetermined one of the Fourier coefficients corresponding to the set of shares which gives the value of the data element, e.g., the Fourier coefficient may be equal to the data element. In this case, it is the zeroth Fourier coefficients (e.g. the Fourier coefficient with index 0) which determines the value of the corresponding data element. This choice simplifies analysis and implementation as it has the consequence that the sum of the corresponding set of shares also determines the data elements (e.g. equals it). However, this is not needed. In an embodiment, some other Fourier coefficient may determine the data element, e.g., the coefficients of index 1. It is not even needed that the same coefficient represents the data element for the different sets, e.g., in set 331 it may be the Fourier coefficient of index 0, while in set 332 it is the Fourier coefficient of index 1, etc. FIG. 3b shows an example, in which one of the Fourier coefficients has been randomly chosen at compile time as the representing coefficient. In fact, which Fourier coefficient represents the data value may even vary per round, e.g., per update of the internal state. For example, after the next update, in set 331 it may be the Fourier coefficient of index 2, while in set 332 it is the Fourier coefficient of index 3, etc. For example, the Fourier coefficients may be permuted in an affine part of the round function, but not during a non-linear part of the round function.

Even more generally, it is not needed that a single Fourier coefficient determines the data element. For example, in an embodiment a subset of the Fourier coefficients determines the data element, e.g., a subset with 2 or more elements. The subset is a proper subset, e.g., at most half of the Fourier coefficients determine the data values. The remaining Fourier coefficients are used to protect against attacks, such as the share reduction attack.

Some embodiments in which sets of Fourier coefficients have multiple representing elements are illustrated with respect to FIGS. 4a-4b . In these figures only the set or sets of Fourier coefficients are shown and not the corresponding set of shares. In other words, what is shown in these figures corresponds to box 330 in FIGS. 3a and 3b . As in FIGS. 3a and 3b , the box 430 shown in FIGS. 4a-4b would itself not be present in an implementation. Instead, encoded sets of shares are present in the implementation for which the Fourier transform of the decoding corresponds to boxes 430. The same holds for FIGS. 4c-4e

FIG. 4a shows multiple sets 431, 432 . . . 433 of Fourier coefficients in box 430 with each set comprising four representing elements (shown as shaded circles), in this case the first four elements, e.g., indices 0, 1, 2, and 3. The number or positions of the representing elements may change. For example, each representing elements may be equal to an element of the internal state.

The number of representing elements need not be the same for each set. For example, in an embodiment with an internal state of 16 bytes and a Fourier transformation over the convenient binary field with 256 elements, one may take four sets of Fourier coefficients each having 17 bytes, four of each representing the 16 bytes of the internal state. The remaining 4*17−4*4=52 bytes may be used as non-representing bytes, e.g., as error-detecting bytes. For example, some predetermined property may be enforced on the non-representing bytes in case of normal, e.g., untampered, execution. Corresponding to the 4 sets of 17 elements, one might have 4 sets of 17 shares, e.g., also bytes. The sets of shares related to the sets shown in FIG. 4a are related to through a Fourier transform. An encoding of the sets of shares, e.g., component wise encoding, is stored in the memory. An advantage of this example, is that it uses much fewer bytes to represent an internal state of the same size using share sets of the same size according to FIG. 3a , i.e., 4*17 instead of 16*17 bytes. Furthermore, the embodiment of FIG. 4a has the advantage that a small modification made the share sets corresponding to FIG. 4a are likely to modify multiple data elements at the same time, thus complicating fault attacks.

Other examples of encoding an internal state of 16 bytes include two sets of Fourier coefficients each having 8 representing bytes, and three sets of Fourier coefficients having 5, 5 and 6 representing bytes. The non-linear operation may be performed on the representing elements by applying a convolution network to all individual shares, while the affine operations may be done by an affine operation which takes all sets of shares as input.

FIG. 4b illustrates a further embodiment. In this case the entire internal state is represented in a single set of Fourier coefficients 431. For example, in case of an internal state of 16 bytes, one may use a set of Fourier coefficients with, say 17 or 51 elements, which in turn would give 17−16=1 or 51−16=35 non-representing elements.

These examples of encoding an internal state may be varied as required by the cryptographic primitive that is implemented. For example, an internal state of more or fewer bytes could be represented by using more or fewer representing coefficients. For example, in the examples above one may turn a representing coefficient to a non-representing one or vice versa to accommodate a decrease or increase of the size of the internal state. In embodiments, the size of the sets of shares is equal to the size of the set of Fourier coefficients, this being a result of the application of the discrete Fourier coefficient. However, in an embodiment one may hide this by adding dummy elements to sets. Furthermore, in embodiments the size of sets of Fourier coefficients is chosen as a divisor of the size of the field minus one. For example, for bytes suitable choices are divisors of 255 such as 15, 17, 51, or 85. One may require sets to be as large as the internal state itself. This is not required, but may give additional security advantages, since the entropy in the input is then fully preserved in the sets. This would give set of shares of size 17, 51, 85 or 255. At the cost of adding complexity to implement the underlying arithmetic one could use other fields to obtain other sizes for the set, e.g., using ternary logic, one may use the field with 243 elements, which in turn allows one to work with sets of 11 or 121 elements, etc.

In these examples, each set of Fourier coefficients comprises some element which is not required to represent an element of the internal state. Such elements may be used to detect tampering with the regular execution. For example, consider an operation which receives as input one or more sets of shares for which some or all of the non-representing elements satisfy some expected property. The correct execution of the operation may be dependent upon that property being present. If tampering modifies the property then correct execution is impaired, resulting in results which are not according to the expectations of an attacker. This in turn will frustrate his attempts, e.g., of fault attacks or of finding a collision, etc.

In an embodiment, a set of Fourier coefficients corresponding to a set of shares comprises both one or more representing elements and one or more error-detecting elements, wherein the representing elements determine one or more data elements of the internal state, and wherein the one or more error-detecting elements comprise redundant data arranged to detect tampering of the set of shares. For example, during the updating the values of the representing elements in the updated internal state may depend on the representing elements for the previous internal state. In addition, the values of the representing elements may depend upon the error-detecting elements, e.g., by including, e.g., adding a distortion which is zero in case the error-detecting elements do not detect an error. The distortion may be done in operations in intermediate rounds, e.g., not at specific or final rounds, e.g., if the redundant information can be verified locally. This is the case for such relationships as two coefficients being equal or having a specific value and the like. This may also be done at the output operator or only at some specific later round in case the relationship is global, examples of which are given below.

In an embodiment, the sets of Fourier coefficients corresponding to the sets of shares in the memory satisfy a predetermined relationship among them. This predetermined relationship is preserved by the updating, e.g., as an invariant. The basic idea is to partly use the freedom available in the selection of shares that represent a variable for enforcing relations between the sets of shares representing different variables. The relationship is expressed in terms of the Fourier transform in the finite field F₂₅₆. For example, in an embodiment, the predetermined relationship comprises that some of the Fourier coefficients are equal.

It has an advantage if the relationship, in particular an equality relationship, is between coefficients in different sets. This has the advantage that the number of valid sets of shares for a single share set is not reduced. This could happen in particular, if a set of shares is relatively small and/or contains relatively few representing elements. If the number of valid sets of shares is reduced too much, a risk of collision attacks is introduced. Introducing redundancy in the encoding of an internal state by requiring that Fourier coefficients of different sets of Fourier coefficients are equal does not reduce the number of valid set of shares and thus does not increase the risk of a collision in a single set of shares. On the other hand, if a set of Fourier coefficients contains many representing elements this risk is smaller. In particular if it contains a full copy of the internal state, there is no risk of a collision anyway, and thus one may more freely choose the relationship. How large an acceptable risk of collision is allowed, depends on the application. How large of a risk is still acceptable depends on such factors as the economic value of the protected key or the expected resources of an attacker. For Grey-box instead of White-box implementations more risks could also be taken. Below various examples of relationships are given.

For example, in an embodiment the relationship comprises that two or more Fourier coefficients of different sets of Fourier coefficients are equal. For example, particular Fourier coefficients may be selected, e.g., at compile time. For example, in an embodiment the sets of Fourier coefficients are ordered, coefficients in the set having an index. The predetermined relationship comprises that for at least some index, at least two of the Fourier coefficients of the same index are equal. For example, the predetermined relationship may require that the zeroth Fourier coefficients of sets 331 and 332 are equal. The predetermined relationship may also comprise that for at least some index, all of the Fourier coefficients of that index are equal. For example, the predetermined relationship may require that the zeroth Fourier coefficients of sets 331, 332, 333 and all other sets of Fourier coefficients are equal.

The relationship is preferably extended to more, or more preferably all share sets. For example, in an embodiment, an index is chosen for each set of Fourier coefficients, the relationship comprising that the chosen Fourier coefficients of those sets are equal. For example, if there are 16 sets, one may select 16 indices, one for each set, and require that the corresponding Fourier coefficients are equal. For example, the coefficients with indices 1, 5, 7, . . . , in the first, second, third set of Fourier coefficients, . . . , respectively, may be equal.

The stricter the requirement on the predetermined relationship the harder it is for an attacker to find a collision. For example, the predetermined relationship may be that each Fourier coefficient in a set of Fourier coefficients, except one, is equal to a respective Fourier coefficient in the other sets of Fourier coefficients; the one exception being used to represent the data element. One way to do this is to require that Fourier coefficients of the same index are equal, except for one index, say the zeroth index. For example, the first Fourier coefficients in sets 331, 332, 333, . . . , may be equal, the second Fourier coefficients in sets 331, 332, 333, . . . , may be equal, etc. The same types of relationships may be used in embodiments that have more than one representing element in its sets of Fourier coefficients, e.g., as shown in FIGS. 4a -4 b.

The examples above do not impose relationships between Fourier coefficients in the same set. For example, for any internal state and any choice for one of the sets of shares, say any choice for set 321 or instead any choice for one of the sets of Fourier coefficients, say set 331, there is a way to choose the remaining set such that the internal state is validly represented and the relationship is satisfied. In other words, the number of valid representations of a single data element in the internal state is not reduced by requiring the relationship between the Fourier coefficients, but the number of valid representations of the entire internal state is.

Relationships can also be defined between Fourier coefficients within the same set of Fourier coefficients. This may reduce the number of valid representations of an internal state as a set of shares, but this may be acceptable. For example, the number of valid representation may still be large enough, in particular the number of valid representation may still be large enough to represent all entropy of the input data to the cryptographic operation, e.g., in case the entire internal state is represented in the set of Fourier coefficients. For example, a good choice is to pick Fourier coefficients with consecutive indices as protective elements, and set the values of said Fourier coefficients to predetermined, fixed values. It can mathematically be shown that in order to create a different set of Fourier coefficients with the predetermined values in, say, b consecutive Fourier coefficients, an attacker must change at least b+1 bytes of the set of shares. The predetermined, fixed values may be chosen randomly at compile time. In an embodiment, predetermined, fixed values are chosen which are not all equal.

One could also require that two or more of the Fourier coefficients within the same set are equal. This is a linear relationship which can be preserved in the affine operations. Equality is automatically preserved in parallel non-linear operations. There is a potential weakness if this type of relationship is the only relationship used, e.g., if the only requirement is that all non-representing data elements in a set of Fourier coefficients are equal. The reason is that an attacker could change the byte in the first symbol, e.g., index 0, and all Fourier coefficients would change with the same amount. In this case the set would be tampered with but the relationship could not detect it. One or more equality relationship could be used however in addition to other requirements, e.g., global relationships or one or more error detecting elements that have a fixed value.

Element in a set of Fourier coefficients received at the beginning of an affine operation that have a known value and/or a known affine or linear relationship (if the execution was not tampered with) can be mapped by an affine or linear operator to an all zero-vector, e.g., by selecting a linear operator for which the kernel comprises the expected values. The zero-vector can have any length, in particular, its length can be equal to the number of representing elements, to the number of all elements in the set of Fourier coefficients. In case the elements do not have their expected values or relationship the operator maps them to a distortion vector. The distortion vector is non-zero for at least one or more set of elements with an unexpected value or relationship, but preferably for all such elements. A different operator can map these elements with expected values or relationship to a further set of elements having further expected values or a further relationship. The further values and relationships may be different. The further elements may be used in a next representation of the internal set as error-detecting elements.

There can be a large choice in selecting the relationship. For example, assuming 16 data elements and n shares per set, using one Fourier coefficient per set as representing the data element and the rest for protection, one could have n(n!)¹⁵ relationships, by selecting a Fourier coefficient in the first set to represent the data element (n choices), and ordering the other sets of Fourier coefficients to indicate which coefficient represents the data element and to which coefficients the rest are equal (n! choices). Selecting a random relationship from this large space further complicates the work of the attacker. For example, each device 100 could receive a different relationship, which could, e.g., also serve to watermark the device.

The operators are chosen such that they preserve the relationship. For linear operators, this can be done since the Fourier transformation is linear and the relationships are linear. Maintaining the relationships for non-linear operators can be done using the following insight. The mapping XαΣ_(j=0) ²⁵⁵F_(j)*X^(j), where X, F₀, . . . , F₂₅₅ are share sets, effectively maps Fourier coefficient {circumflex over (x)}_(k) onto Σ_(j=0) ²⁵⁵({circumflex over (ƒ)}_(j))_(k)({circumflex over (x)}_(k))^(j) where ({circumflex over (ƒ)}_(j))_(k) is the k-th Fourier coefficient of the share set F_(j). In other words, the mapping on the set of shares translates to parallel polynomials on the Fourier coefficients. Thus, if two Fourier coefficients of the same index in different sets are equal, then this relationship is preserved simply by having the same mapping act on both sets of shares. For embodiments in which the same non-linear operator is applied to all data-elements in an internal state, and in which the relationship only implies equality relations for Fourier coefficients with the same index, preserving of the relationship is automatic, simply by applying the same mapping to all share sets. In this case, the share sets F_(j) in XαΣ_(j=0) ²⁵⁵F_(j)*X^(j) can be chosen as any share sets which happen to represent the correct polynomial coefficients for the cryptographic primitive. For example, one may select a random share set F_(j) to represent a coefficient, e.g., at compile time.

Preserving other relationships can be done with an appropriate choice of the F_(j). For example, suppose the first Fourier coefficient in sets 331 is equal to the second Fourier coefficient in set 332, according to the relationship. In this case, one may choose ({circumflex over (ƒ)}_(j))₁ of the non-linear operator acting on the set 331 equal to ({circumflex over (ƒ)}_(j))₂ of the non-linear operator acting on set 332 (for all j). In this way, the relationship is preserved. If, say, the zeroth Fourier coefficient corresponds to the actual value of the data element, then one may choose ({circumflex over (ƒ)}_(j))₀ for these sets according to the desired non-linear operation, e.g., the desired S-box, which is to be performed on the data-elements.

It is also possible to have a data element represented by a subset of the Fourier coefficients, e.g., to determine the data element, e.g., a subset with 2 or more elements may be used. For example, the data element may be equal to the sum of the zeroth and first Fourier coefficient. This can be implemented by selecting to polynomials, expressed through their coefficients ({circumflex over (ƒ)}_(j))₀ and ({circumflex over (ƒ)}_(j))₁, the sum of which is equal to the desired operation on data element, e.g., the desired S-box.

Relationships may also be enforced in case of a single set of shares. For example, in case of FIG. 4b one may require that the non-representing coefficients have a specific value, e.g., are zero, or some other value, e.g., a random value. In an embodiment with multiple non-representing coefficients, at least one, at least two, etc., non-representing elements are equal to a predetermined value or values. The predetermined values may vary from round to round. Even if there is only one set of shares having only one corresponding non-representing coefficients one may require that this coefficient has a particular value, e.g., that it is zero.

Note that any non-linear operation can be expressed as a polynomial. Even if the non-linear operators are defined using their Fourier coefficients, they are evaluated on (encoded) shares of a set of shares. For example, a power of a shares set may be computed as repeated convolutions of the share set with itself.

Updating an internal state in internal state storage 130 may involve non-linear and linear operators. FIG. 1 shows non-linear operations 141, 142, 143. The non-linear operations operating on an internal state may be arranged as separate non-linear operations, e.g., non-linear sub-operations, which act on a single one of the data elements of the internal state. For example, these sub-operations may be the same for all data elements, e.g., the same S-box, or they may be different. Even if the S-box which is performed on the level of the data-elements, say on the level of box 310, are the same, the operations which are performed on the level of the sets of shares, e.g., on box 320, or in the actual encoding on box 340 may be different, e.g., they may perform a different function for Fourier coefficients that are not part of the relationship, e.g., which are used to represent the data value. A non-linear operator acting on a single data-element acts only on the shares in the corresponding set of shares.

FIG. 1 shows linear operations 146, 147, 148. A linear operation updating the internal state act simultaneously on at least two sets of shares in the memory representing at least two data elements of the internal state. For example, a linear operation may be represented as a matrix, e.g., over the field with 2 elements (bits) or the larger finite field, e.g., F₂₅₆. Since both the relationships and the Fourier transform is a linear operation, the linear operation may be constructed by concatenating

-   -   a Fourier operator producing a set of Fourier coefficients for         each set of shares on which the linear operation acts,     -   one or more linear operators acting on the Fourier coefficients         preserving the invariant, and     -   an inverse Fourier operator.

The input to the linear operation may be, e.g., a vector with as elements the shares of two or more sets of shares. For example, in so-far a linear operator acts on Fourier coefficients that represent the data value, they can perform the linear operation needed for the cryptographic primitive, e.g., as desired by a standard; but in so-far the one or more linear operators act only on Fourier coefficients that do not represent the data value, they can perform any linear operation, e.g., a random linear operation, so long as the relationship is preserved. Note that if, say due to a fault attack, the relationship was not satisfied in the first place, it is preferred that the relationship stays invalid, or at least that the chance of accidentally restoring the relationship is not better than with a uniform random distribution.

For example, in an embodiment in which the relationship requires that Fourier coefficients with the same index are equal, except for the one (or more) Fourier coefficient that represents the data value, one may use the following:

-   -   a Fourier operator producing a set of Fourier coefficients for         each set of shares on which the linear operation acts, the sets         of Fourier coefficients being ordered with coefficients in the         set having an index,     -   one or more linear operators only acting on Fourier coefficients         of the same index, e.g., independent of Fourier coefficients of         a different index, the one or more linear operators being         arranged to act on Fourier coefficients preserving the         invariant,     -   an inverse Fourier operator.

Such a separation of operators is possible, but not necessary. For example, the one or more linear operators could comprise one operator to act on the Fourier coefficients that represent the data element, e.g., acting on one or more Fourier coefficients per set, and one linear operator that acts on all the remaining Fourier coefficients, e.g., a random linear operation except for the requirement that it preserves the relationship.

FIG. 4c gives a further example of a relationship within a box 430. FIG. 4c shows a set of Fourier coefficients 431 portioned into three parts, labeled with roman numerals I, II and III. Although FIG. 4c shows these parts consecutively, this is not necessary, e.g., the three parts could be distributed over the elements of set of Fourier coefficients 431 in any manner, e.g., randomly. Part III may be empty in this example.

The coefficients under label I represent the internal state. In this example, the entire internal state is represented in a single set of Fourier coefficients. The coefficients under label II also represent the internal state. In this example, the entire internal state is represented in a single set of Fourier coefficients twice. For example, in case of bytes and an internal state of 16 bytes one could use a set of 51, 85 or 255 shares. The updating of the internal state is done in the same manner for the coefficients II as for coefficients I, and both coefficients I and II are initiated from the input data in the same manner. The result is that after the last round both coefficients I and II contain the end result of the cryptographic operation. The output operator could use this by distorting the output in case the coefficients under I and II are not the same. For example, an output operator may map a set of shares to the data elements it represents plus a distortion. The distortion depends on the Fourier coefficients of the set of shares such that the distortion is zero if the Fourier coefficients in the two branches are equal.

In an embodiment, both parts I and II represent the entire internal state. For example, part I could be computed during updating from a corresponding part I in a previous encoding of the internal state and part II could be computed from a corresponding part II in a previous encoding of the internal state or vice versa (e.g. part I is computed from part II, and the other way around). The updating during non-final rounds could introduce a distortion if parts I and II are unequal, this could also be postponed until the final round, or until an output operator is applied.

It is not necessary that part I and II both contain the entire internal state. For example, part II may comprise only selected data elements of the internal state, e.g., bytes 4, 9, 10, and 13 (out of 0-15). In this case, the new part II may be computed from the previous part II extended with the missing data elements taken from part I.

The evaluation of the block cipher on parts I and II need not be in parallel, so that parts I and II in the same round are different. For example, one may execute an unequal number of dummy rounds on parts I and II before starting with the evaluation of the cryptographic operation itself. In this case parts I and II will be different, but at the end, once the two branches synchronize again, their values are equal. This is an example of a global relationship between the Fourier coefficients that cannot be checked locally. After synchronization occurs, an operator can introduce the distortion, but not earlier.

The non-representing coefficients III may be used to detect tampering using other means, e.g., by requiring that they are equal to a predetermined value, etc. In an embodiment, not all non-representing coefficients are equal. Note that even if the two branches I and II are equal, this will not be directly visible in the code. For one thing, the set of Fourier coefficients is only present in the form of a set of shares. A Fourier transform would be required on the set of shares to see if some of the Fourier coefficients are equal. But even the set of shares will generally not be visible in the code, as the shares in a set of shares are encoded. For example, separate and different encodings could be used for the different elements in a set of shares. For a grey box implementation, one could economize on the encodings used. For white box implementations, however, encoding of a set of shares would be needed, since otherwise an attack would only need to execute the known Fourier transform to obtain the representing coefficients.

In this particular case, although coefficients II do represent the internal state, they are still used as error-correcting. An advantage of using the input to initialize part II is that in this way entropy is introduced without using a random number generator.

FIG. 4d shows a set of Fourier coefficients 431, wherein coefficients I and III are as in FIG. 4c . On coefficients IV a series of round functions is applied as part of the rounds, which round functions are chosen such that the concatenation of them is the identity. For example, one could evaluate AES as usual on the first half of the rounds, and use the inverse of AES for the second half of the rounds. The block cipher used need not be AES, but may be any block cipher, e.g., AES but with different affine and non-linear operators, e.g., a different s-box. The result is that after the final rounds, the coefficients IV are the same as the original input to coefficients IV. For example, one may select a fixed constant as input for coefficients IV, in which case the same input should occur on the output. One could also use the same input coefficients IV as for coefficients I, so that the original input is present at the output. The latter may be used by producing not the regular output, but the regular output plus (say xor) the input. To obtain the regular output one would have to subtract (say xor) the input.

FIG. 4e shows a set of Fourier coefficients 431, wherein coefficients I and III are as in FIG. 4c . On coefficients V, a predetermined sequence of round functions is applied, applied to a fixed input constant. The result is that one can compute what the correct end result for coefficients V should be. For example, one could initialize coefficients V with all zeros and evaluate AES for it. The end result would be the AES evaluation of the initial input, in this case the all-zero input. Both in FIGS. 4d and 4e the output operator could distort if the expected values are not seen in coefficients IV or V. If AES is used for parts IV or V they may use an alternative random key. It is not necessary that parts IV and V have the same size as the internal state, they may be smaller. In such a case, one may operate on this part using a custom block cipher with a smaller input size. For example, one may modify AES to operate on a smaller input size by choosing smaller operators. For example, parts IV and V could be chosen to be 8 bytes instead of 16. They could be larger as well.

The examples given for FIGS. 4a-4e are examples of global relationships that are enforced over multiple rounds. For example, in case of FIGS. 4c-4e the parts I, II, IV and V may be different from one another.

Note that it may happen that a Fourier coefficient could both be regarded as a representing coefficient and as an error detection element. For example, consider the embodiment illustrated by FIG. 4c . One may regard the elements in part I as representing elements, since they determine the internal state. One may regard the elements in part II as error-detecting elements: These Fourier coefficients comprise redundant data since they are not needed to determine the internal state; Moreover, as the information in part II is fully determined by the information in part I they are error-detecting. If part I changes without the corresponding change in part II, or vice versa, an error is detected. However, one could equally well regard part II as the representing part, and part I as the error-detecting part. In an embodiment, one or more of the error detecting elements can be derived from the representing elements; in an embodiment one or more of the error detecting elements may be independent of the representing elements. For example, in an embodiment at least one of the error-detecting elements is equal to a representing element, and/or at least one of the error-detecting bits is equal to a predetermined value. For example, in an embodiment part of the elements in a set of Fourier coefficients corresponding to set of shares, represent element of the internal set and part are additional element suitable to detect modification to this or other sets of shares.

The examples above encode the internal state in a single part I of a single set of shares, but alternatively, one could divide the internal state over two or more sets of shares; the non-representing coefficients could be used in the same manner as parts II-V.

It is also noted that these ideas may be combined, or be combined with other white-box techniques. For example, a set of Fourier coefficients may contain multiple parts: one or more copies of the internal state, one or more parts which reproduce the input, and/or one or more parts that produce a fixed value. The output operator may distort if any of these relationships is not satisfied.

An advantage of combining multiple algorithms, e.g., multiple copies of a block cipher together in the same set or sets of shares, e.g., by representing at least part of two different internal states in a single set of shares is that no control flow is visible that indicates when which algorithm is operating. If branching and/or recombination rounds were visible, this might limit the search space of an attacker. He knows how many times he has to inject a fault at an internal state, namely the number of branches, and once in each branch.

Note that the low-level multiplications when evaluating the matrix product may be done by table-lookup if the shares are encoded. Alternatively, the decoding and re-encoding of shares may be integrated in the linear operation if the encodings are linear. The former may be more secure as it avoids linearities, but has the downside of significantly increasing the code size, e.g., as an increase in the number of tables or polynomials.

As noted, some of the operations may be keyed. For example, in an operation a round key may be added to all or part of the internal state. The key may be stored in device 100 in an encoded form. Preferably, the keys use the same type encoding as the internal state does, e.g., as set of (encoded) shares with restrictions imposed on the Fourier coefficients of the sets. For example, the key may be represented in a memory of device 100 as a corresponding set of shares, the set of shares satisfying the predetermined relationship between the Fourier coefficients corresponding to the set of shares of the key according to the discrete Fourier transform in the finite field.

Returning to FIG. 1, the figure further shows an input interface 110 arranged to receive the input data. For example, the input interface 110 may comprise a computer network connection, a computer storage unit, etc. Input interface 110 may comprise an application programming interface (API); further examples are given herein. In an embodiment, the input data may already be encoded in a manner suitable for the internal state. Below we will describe a situation in which the input interface is not encoded according to a private encoding. In that case device 100 may comprise an optional input operator 112 to the plain input data. Input operator 112 produces multiple sets of shares representing the initial internal state. The multiple sets of shares satisfying the predetermined relationship.

For example, the input operator may be constructed by concatenating a number of linear operators:

-   -   an operator to map the input data to one or more sets of Fourier         coefficients. If non-representing coefficients are used to         satisfy some relationship, the input operator may be configured         so that the input data is mapped to one or more sets of Fourier         coefficients that satisfy the relationship. For example, the         operator may map the input data to the Fourier coefficients that         represent the data elements. For example, if a single Fourier         coefficient per set represents the data element, the operator         could map data elements of the input directly to the         corresponding Fourier coefficient. If multiple Fourier         coefficients together represent an input data element (e.g. as         the sum), all but one of the Fourier coefficient may be selected         at random, and the last one may be computed from the input data         element and the selected random Fourier coefficients. For the         remaining protective Fourier coefficients, random choices may be         made satisfying the relationship. A random Fourier coefficient         may be selected by applying a random operator to the input data.         In white-box implementations it is often inadvisable to use a         separate random number generator. For a grey-box implementation         only, the random Fourier coefficients could be selected by a         random number generator.     -   an inverse Fourier transform, and     -   an encoding operation, e.g., to encode each of the shares. The         encodings may be chosen linear. There may be multiple different         encodings. For example, for each one of the shares a different         encoding may be used.

It has an advantage if the bit size of a share set is at least as large as the size of the input data. In this case, it is unlikely that a collision will occur, that is that two different input data will cause a collision on a share set. A better guarantee is obtained by making the input operator injective for each share set. That is, the input operator may be chosen such that the input data can be uniquely determined from the content of a single set of shares representing a single data element. For the case of AES, this can be achieved by taking 17 shares. In such an implementation of AES with 17 shares, all collisions are avoided, so it is expected to be fully secure against Mutual Information Analysis (MIA).

Device 100 further comprises an output operator 122 to derive the output data from a final internal state. Output operator 122 maps a set of shares to the data element(s) it represents plus a distortion. The distortion depends on the Fourier coefficients of the set of shares such that the distortion is zero if the Fourier coefficients satisfy the predetermined relationship. The output data may be plain output data, or output data encoded in an encoded form as expected by a next application that may make use of the output data. We will assume that the output data is plain output data.

For example, the output operator may be constructed by concatenating

-   -   a decoding operator to remove an encoding of the internal state     -   a Fourier transform to transform the internal state to one or         more sets of Fourier coefficients     -   an operator that maps those Fourier coefficients that represent         a data element, to the data element they represent.     -   an operator that maps the protective Fourier coefficients to a         distortion, e.g., a distortion vector. The operator is         constructed such that it maps Fourier coefficients that satisfy         the relationship to 0, e.g., to no distortion. For example,         vector(s) representing the relationship may be in the kernel of         the operator.

Optionally, an encoding operator could be added in case a subsequent application expects the data to be delivered in an encoded form.

Below a detailed embodiment is given of a cryptographic primitive implemented in a cryptographic device or method according to the invention. The chosen cryptographic primitive is the AES block cipher, chosen as an illustration. The description below is for the encryption operation, however the decryption operation follows straightforward. The embodiments shown in detail below use a single representing Fourier coefficient for each set of Fourier coefficients. In total 16*17 bytes of encoding for the internal states are used.

Note that for many elements variant implementations are possible. It is possible to build an AES implementation with n shares, where n is a divisor of 255, with the property that before and after all AddRoundKey, ShiftRow, MixColumns and SubBytes operations (or their inverses for AES decryption), for each k, 1≤k<n, the k-th Fourier coefficients (ŝ_(k))_(r,c) of the share sets S_(r,c) representing state byte s_(r,c)=(ŝ₀)_(r,c) are equal for all row and column indices r,c. The row and column indices refer to a representation of the internal state of AES as a state array, e.g., with 4 rows and 4 columns. For the additive transformations AddRoundKey, ShiftRows and MixColumns this can be achieved by a suitable choice of the transformation on the Fourier coefficients, as will is detailed herein, while for the SubBytes operation this property can be guaranteed since the Fourier transform is compatible with polynomials acting on share sets. In this embodiment, one particular choice for the relationship is made. Moreover, the zeroth Fourier coefficient is used to represent a data element of internal state.

Suppose that, in such an implementation, an attacker changes a few shares in a share set, say S_(0,0), in such a way that (ŝ₀)_(0,0) is unchanged. Then at least one of the other Fourier coefficients (ŝ_(k))_(0,0),K,(ŝ_(n−1))_(0,0) must have changed (since otherwise he would not have changed anything). If before the change, for 1≤k<n, the k-th Fourier coefficients (ŝ_(k))_(r,c) of the 16 share sets S_(r,c) that represent the 16 state bytes s_(r,c), are all equal to each other, then after the change there is at least one value of k, 1≤k<n such that the k-th Fourier coefficient of the changed share set S_(0,0) is different from the k-th Fourier coefficient of the 15 other share sets.

When generating the AES output, which consists of 16 bytes, from the 16 share sets after the last AES operation, care must be taken to ensure that each output byte out_(i) depends on (ŝ₀)_(i mod 4,└i/4┘) and all (ŝ_(k))_(r,c), 1≤k<n, 0≤r<4, 0≤c<4, in such a way that the output is wrong (e.g. out_(i)≠(ŝ₀)_(i mod 4,└i/4┘) for at least one value of i) when at least one (ŝ_(k))_(r,c) is different from the other (ŝ_(k))_(r′,c′).

We note that this mechanism also makes a normal DFA attack more difficult: now the attacker's goal is to change some share set X in such a way that he can obtain information about the key from the way the output changes. But when this mechanism is in place, the only changes that the attacker can make that give outputs that he may consider useful, are those where he only changes the zeroth Fourier coefficient of a share set, and leaves the other Fourier coefficients invariant. If only a single Fourier component is to be changed, then all shares of X must be changed appropriately, which implies that the attacker needs to perform an n-th order DFA in order to be successful.

Here we present AES implementations that use the ingredients given before. The AES implementation transforms a 128-bit input into a 128-bit output at run time. The implementations are created at compile time. The security of the implementations depends mainly on the number of shares, n. We first give the details for constructing an AES encryption.

At compile time, the implementer does the following:

1. Choose the number of shares, n, where n is a divisor of 255. Choosing n=1 does not offer a security advantage over a default AES implementation, and n∈{51,85,255} may be too large to be practical, so preferably n∈{3,5,15,17}. The implementer also chooses an element Ω∈F₂₅₆ with ord(Ω)=n. As noted, the choice n=17 is especially beneficial.

2. The implementer expands the AES key into the (N_(r)+1) round keys, as specified in the AES standard. Each round key consists of 16 bytes, arranged in a 4×4 array. The round key bytes are denoted

{circumflex over (κ)}_(i,j;0) ^((r)) with 0≤r≤N_(r), 0≤i<4, 0≤j<4.

For each round index r, 0≤r≤N_(r), the implementer randomly chooses n−1 bytes, denoted {circumflex over (κ)}_(k) ^((r)) with 1≤k<n. For each round r and position i,j, the implementer creates the n-component round key shares K_(i,j) ^((r)) that have {circumflex over (κ)}_(i,j;0) ^((r)) and {circumflex over (κ)}₁ ^((r)),K,{circumflex over (κ)}_(n−1) ^((r)) as Fourier coefficients, so that K_(i,j) ^((r))=(κ_(i,j;0) ^((r)),K,κ_(i,j;n−1) ^((r))) with

$\begin{matrix} {\kappa_{i,{j;m}}^{(r)} = {{\hat{\kappa}}_{i,{j;0}}^{(r)} + {\sum\limits_{k = 1}^{n - 1}\;{\Omega^{- {km}}{\hat{\kappa}}_{k}^{(r)}}}}} & {0 \leq m < {n.}} \end{matrix}$

3. For each round r, position i,j and each share index m, the implementer randomly chooses an invertible additive encoding E_(i,j;m) ^((r))∈E. The size of the AES implementation grows linearly with the number of round encodings that are used. To reduce the size of the implementation, the implementer can choose to use the same encodings in each round, so that the encodings do not depend on r; he may also choose to alternate the encodings per round, so that the encodings depend on r only through r mod 2. These choices have no effect on the security against the collusion and DFA attacks we consider choosing a larger number of different encodings makes some white-box attacks harder. In each round r, the 16n encodings E_(i,j;m) ^((r)) are preferably all distinct. The inverse of E_(i,j;m) ^((r)) will be denoted D_(i,j;m) ^((r)).

4. The implementer calculates the encoded round key shares {tilde over (κ)}_(i,j;m) ^((r))=E_(i,j;m) ^((r))(κ_(i,j;m) ^((r))) and creates the encoded key share sets {tilde over (K)}_(i,j) ^((r))=({tilde over (κ)}_(i,j;0) ^((r)),K,{tilde over (κ)}_(i,j;n−1) ^((r))).

5. The implementer calculates encoded multiplication tables containing the bytes {tilde over (μ)}_(i,j;m) ₀ _(,m) ₁ _(;e) ₀ _(,e) ₁ ^((r)) =E _(i,j;(m) ₀ _(+m) ₁ _()mod n) ^((r))(D _(i,j;m) ₀ ^((r))(2^(e) ⁰ )·D _(i,j;m) ₁ ^((r))(2^(e) ¹ )).

Here 0≤r<N_(r), 0≤m₀,m₁<n, 0≤e₀,e₁<8. Since the multiplication tables satisfy the symmetry property {tilde over (μ)}_(i,j;m) ₀ _(,m) ₁ _(;e) ₀ _(,e) ₁ ^((r))={tilde over (μ)}_(i,j;m) ₁ _(,m) ₀ _(;e) ₁ _(,e) ₀ ^((r)),

the implementer may, for instance, choose to store only the elements of the multiplication tables with e₀≤e₁.

For example, one may implement the powers of two used above as 2{circumflex over ( )}0=00000001, 2{circumflex over ( )}1=00000010, 2{circumflex over ( )}2=00000100, 2{circumflex over ( )}3=00001000, 2{circumflex over ( )}4=00010000, 2{circumflex over ( )}5=00100000, 2{circumflex over ( )}6=01000000, 2{circumflex over ( )}7=10000000; these numbers or bit strings form a basis of the field.

6. For each 0≤r<N_(r), the implementer chooses a random share representation S(0)^((r)) of S(0), the output of the S-box when the input equals 0, and random share representations M_(k) ^((r)) of the polynomial coefficient m_(k), for 0≤k<8, of the additive operator M in the S-box. The implementer encodes the shares of these representations, which gives position-dependent encoded share sets {tilde over (S)}(0)_(i,j) ^((r))=(E_(i,j;0) ^((r))(s(0)₀ ^((r))),K,E_(i,j,n−1) ^((r))(s(0)_(n−1) ^((r)))) and {tilde over (M)}_(k,i,j) ^((r))=(E_(i,j;0) ^((r))(m_(k;0) ^((r))),K E_(i,j;n−1) ^((r))(m_(k;n−1) ^((r)))).

7. For any round index 0≤r<N_(r), the implementer creates an additive operator {tilde over (L)}^((r)) on 16n bytes as {tilde over (L)}^((r))=E^((r+1))F⁻¹T⁻¹L^((r))TFD^((r)), where

-   -   For any round index r, 0≤r≤N_(r), D^((r)) is defined as the         operator that takes as input a vector (B₀,K,B_(16n−1)) of 16n         bytes, and, for 0≤i, j<4 and 0≤m<n, applies D_(i,j;m) ^((r)) to         B_(n(i+4j)+m);     -   For any round index r, 0≤r≤N_(r), E^((r)) takes as input a         vector (B₀,K,B_(16n−1)) of 16n bytes, and, for 0≤i, j<4 and         0≤m<n, applies E_(i,j;m) ^((r)) to B_(n(i+4j)+m);     -   F takes as input a sequence of 16n bytes (B₀,K,B_(16n)) and, for         each i,j, sets X=(B_(n(i+4j)),K,B_(n(i+4j)+n−1)), applies the         Fourier transform to X and sets         (B_(n(i+4j)),K,B_(n(i+4j)+n−1))←({circumflex over         (x)}₀,K,{circumflex over (x)}₁₅).     -   T takes as input a vector of 16n bytes ({tilde over         (B)}₀,K,{tilde over (B)}_(16n−1)), and permutes them into the         sequence ({tilde over (B)}′₀,K,{tilde over (B)}′_(16n−1)), where         {tilde over (B)}′_(16m+i)={tilde over (B)}_(in+m), for 0≤i<16,         0≤m<n;     -   L^((r)) takes as input a vector of 16n bytes ({tilde over         (B)}′₀,K,{tilde over (B)}′_(16n−1)) and, for each k with 0≤k<n,         applies transformation L_(k) ^((r)) to the 16-byte vector         ({tilde over (B)}′_(16k),K,{tilde over (B)}′_(16k+15)).

The transformation L₀ ^((r)) puts its input ({tilde over (B)}′₀,K, {tilde over (B)}′₁₅) into a 4×4 matrix A with A_(i,j)={tilde over (B)}′_(i+4j), 0≤i,j<4. If 0≤r<N_(r)−1, it applies the MixColumns oShiftRows operation to A; if r=N_(r)−1, it applies the ShiftRows operation to A. It then outputs the 16 bytes of A column-wise.

For 1≤k<n, the transformation L_(k) ^((r)) is a randomly chosen additive invertible transformation on 16 bytes with the property that, when acting on a 16-byte vector whose entries are all equal, it outputs a 16-byte vector whose entries are all equal. It is shown in below how such transformations can be generated efficiently.

8. The implementer constructs an additive operator Ũ_(in), operating on 16 bytes and outputting 16n bytes, as Ũ_(in)=E⁽⁰⁾F⁻¹T⁻¹U_(in), where

${U_{in}\left( {B_{0},K,B_{15}} \right)} = \left( {B_{0},K,B_{15},{{\quad\quad}\underset{\underset{16{times}}{1\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 44\mspace{14mu} 2\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 43}}{{R_{{in},1}\left( {B_{0},K,B_{15}} \right)},K,{R_{{in},1}\left( {{B_{0,}K},B_{15}} \right)}, K}\underset{\underset{16{times}}{1\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 44\mspace{14mu} 2\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 4\mspace{14mu} 43}}{\left. {{{\quad\quad}K},{R_{{in},{n - 1}}\left( {B_{0},K,B_{15}} \right)},K,{R_{{in},{n - 1}}\left( {B_{0},K,B_{15}} \right)}} \right),}}} \right.$

and each R_(in,k), 1≤k<n, is a random additive operator acting on 16 bytes and outputting one byte; it is repeated 16 times in U_(in). A good method for constructing the operators R_(in,k) is to choose a random invertible operator R on 16 bytes, and let R_(in,k)(B₀,K,B₁₅)=B′_(k−1) where (B′₀,K,B′₁₅)=R(B₀,K,B₁₅). When n=17, this construction guarantees that there is a bijection between the 16 input bytes (B₀,K,B₁₅) and 16 bytes (R₁(B₀,K,B₁₅),K,R₁₆(B₀,K,(B₁₅)). It follows that there is a bijection between the 16 input bytes and the 16 Fourier coefficients ŝ₁,K,ŝ₁₆ with non-zero indices of the share set representing any state byte, so that different inputs always give different share sets: there are no collisions.

9. The implementer constructs an operator Ũ_(out) as Ũ_(out)=U_(out)TFD^((N) ^(r) ⁾ where

${{U_{out}\left( {B_{0},K,B_{{16n} - 1}} \right)} = {\left( {B_{0},K,B_{15}} \right) + {\sum\limits_{k = 1}^{n - 1}\;{R_{{out},k}\left( {B_{16k},K,B_{{16k} + 15}} \right)}}}},$

where each R_(out,k), 1≤k<n, is a random additive operator acting on 16 bytes and outputting 16 bytes, with the property that when acting on a 16-byte vector of which all entries are the same, the all-zero vector is output.

The implementer builds an AES encryption program that uses the operators Ũ_(in), {tilde over (L)}^((r)) and Ũ_(out), the encoded key shares {tilde over (K)}_(i,j) ^((r)), the encoded multiplication tables {tilde over (μ)}_(i,j;m) ₀ _(,m) ₁ _(;e) ₀ _(,e) ₁ ^((r)), the S-box offset shares {tilde over (S)}(0)_(i,j) ^((r)) and linear transformation constant shares {tilde over (M)}(0)_(k,i,j) ^((r)). Using the multiplication tables, the implementer creates the functions Mul, Conv and Square.

The function Mul multiplies two individually encoded shares x and y, with respective indices m_(x) and m_(y), encoded according to the encodings of shares m_(x) and m_(y) in round r and position i,j, and returns the encoded result encoded according to the encoding of share index (m_(x)+m_(y))mod n in round r and position i,j. Note that in a convolution with n shares, the product x_(m) _(x) y_(m) _(y) shows up in the share z_(m) _(x) _(+m) _(y) _(mod n) of z=xy. The position i,j is the position in the 4×4 array of the AES state. A pseudocode implementation is

  Mul(r,i,j,m_(x),m_(y),x,y): find bits ξ₀,K ,ξ₇ such that x = Σ_(k=0) ⁷ξ_(k)2^(k) find bits η₀,K ,η₇ such that η = Σ_(k=0) ⁷η_(k)2^(k) return Σ_(e) _(x) ⁻⁰ ⁷ξ_(e) _(x) Σ_(e) _(y) ⁻⁰ ⁷η_(e) _(y) {tilde over (μ)}_(i,j;m) _(x) _(,m) _(y) _(;e) _(x) _(,e) _(y) ^((r))

where the summations are over F₂₅₆.

The function Conv returns the encoded convolution of two encoded share sets, X=(x₀,K,x_(n−1)) and Y=(y₀,K,y_(n−1)), according to the encodings in round r at position i,j. A pseudocode implementation is

  Conv (r,i,j,X,Y): Z ← (0,K ,0) for 0 ≤ m_(x) < n  for 0 ≤ m_(y) < n  z_((m) _(x) _(+m) _(y) _()mod n) ← z_((m) _(x) _(+m) _(y) _()mod n) + Mul(r,i,j,m_(x),m_(y),x_(m) _(x) ,y_(m) _(y) ) return Z

where the summation is over F₂₅₆.

The function Square returns the encoded convolution of encoded share set X=(x₀,K,x_(n−1)) with itself, according to the encodings in round r and position i,j. A pseudocode implementation is

  Square (r,i,j;X): Z ← (0,K ,0) For 0 ≤ m_(x) < n  z_((2m) _(x) _()mod n) ← z_((2m) _(x) _()mod n) + Mul(r,i,j,m_(x),m_(x),x_(m) _(x) ,x_(m) _(x) ) return Z

where the summation is over F₂₅₆.

Using these functions as subroutines, the implementer creates the function Inverse, which returns the 254-fold encoded convolution of encoded share set X with itself, according to the encodings in round r and position i,j. A pseudocode implementation is

  Inverse (r,i,j;X): Y ← Square(r,i,j,X) Z ← Conv(r,i,j,X,Y) Y ← Square(r,i,j,Y) X ← Conv(r,i,j,Y,Z) Y ← Square(r,i,j,Y) Z ← Conv(r,i,j,X,Y) Z ← Square(r,i,j,Z) Z ← Square(r,i,j,Z) Z ← Square(r,i,j,Z) Y ← Conv(r,i,j,X,Z) Y ← Square(r,i,j,Y) return Y

The function ShareSbox returns an encoded share representation of the output of the S-box operator, acting on an encoded share set X by means of convolutions that are encoded according to the encodings in round r and position i,j. A pseudocode implementation is

  ShareSbox (r,i,j,X): Y ← Inverse(r,i,j,X) Z ← Conv(r,i,j,{tilde over (M)}_(0;i,j) ^((r)),Y) for 1 ≤ k < 8  Y ← Square(r,i,j,Y)  Z ← Z + Conv(r,i,j,{tilde over (M)}_(k;i,j) ^((r)),Y) Z ← Z +{tilde over (S)}(0)_(i,j) ^((r)) return Z

The function SubShares applies the function ShareSbox to each share set, as per the following pseudocode.

SubShares (r,B₀,K ,B_(16n−1)): for 0 ≤ i < 4  for 0 ≤ j < 4  (B_(n(i+4j)),K ,B_(n(i+4j)+n−1)) ← ShareSbox(r,i,j,(B_(n(i+4j)),K ,B_(n(i+4j)+n−1))) return (B₀,K ,B_(16n−1))

The AES encryption function AES encrypts the plain 16-byte input (in₀,K,in₁₅) and returns the plain 16-byte result (out₀,K,out₁₅). An implementation in pseudocode is

  AES (in₀,K ,in₁₅): (B₀,K ,B_(16n−1)) ← Ũ_(in)(in₀,K ,in₁₅) for 0 ≤ r < N_(r)  for 0 ≤ i < 4  for 0 ≤ j < 4   (B_(n(i+4j)),K ,B_(n(i+4j)+n−1)) ← (B_(n(i+4j)),K ,B_(n(i+4j)+n−1)) + {tilde over (K)}_(i,j) ^((r))   (B_(n(i+4j)),K ,B_(n(i+4j)+n−1)) ← ShareSbox (B_(n(i+4j)),K ,B_(n(i+4j)+n−1))  (B₀,K , B_(16n−1)) ← {tilde over (L)}^((r)) (B₀,K ,B_(16n−1)) for 0 ≤ i < 4  for 0 ≤ j < 4   (B_(n(i+4j)),K ,B_(n(i+4j)+n−1)) ← (B_(n(i+4j)),K ,B_(n(i+4j)+n−1)) + {tilde over (K)}_(i,j) ^((N) ^(r) ⁾ (out₀,K , out₁₅) ← Ũ_(out)(B₀,K , B_(16n−1)) return (out₀,K ,out₁₅)

An important feature of the AES program with 17 shares is that for any encoded share set representing a state byte, there exists a bijection between the 16 input bytes and the first to sixteenth Fourier coefficients of the decoded share set. This implies that for two different inputs there can never be a simultaneous collision on the 17 shares in any such share set, so that MIA/Collision attacks won't be successful. More generally, in an embodiment, the internal state of a previous round may be derived from a set of shares in the next round, using knowledge of the implementation (encodings, keys, etc.). For example, in an embodiment there is a bijection between the unencoded (without shares) internal state (or the input) in a round, and a share set of the encoded internal state in the next round.

The construction above uses random additive operators with certain prescribed properties, which are defined at compile time. Here we show how this could be done efficiently. Since a byte is a concatenation of 8 bits, there is a one-to-one mapping between additive operators on N_(bytes) bytes and binary matrices of size N×N, where N=8N_(bytes).

Generating a random invertible binary matrix of arbitrary size N×N. The algorithm consists of the following steps:

1. Construct a binary matrix L of size N×N with ones on the diagonal, zeroes above the diagonal and random bits below the diagonal.

2. Construct a binary matrix U of size N×N with ones on the diagonal, zeroes below the diagonal and random bits above the diagonal.

3. Return A=LU.

Generating a random invertible binary matrix of size 8N_(bytes)×8N_(bytes) with the property that when acting on an N_(bytes)-times repeated sequence of 8 bits it results in an N_(bytes)-times repeated sequence of 8 bits. The algorithm consists of the following steps:

1. Construct random invertible binary matrix A of size 8×8.

2. Construct a random binary matrix B of size 8×8(N_(bytes)−1).

3. Construct a random invertible binary matrix C of size 8(N_(bytes)−1)×8(N_(bytes)−1).

4. Let R be the block matrix

$R = {\begin{pmatrix} A & B \\ 0 & C \end{pmatrix}.}$

5. Construct a random binary matrix L′ of size 8(N_(bytes)−1)×8(N_(bytes)−1) with ones on the diagonal, zeroes above the diagonal and random bits below the diagonal.

6. Construct the block matrix D of size 8(N_(bytes)−1)×8 by stacking L copies of the 8×8 identity matrix I_(8×8).

7. Construct the block matrix

$L = {\begin{pmatrix} I_{8 \times 8} & 0 \\ D & L^{\prime} \end{pmatrix}.}$

8. Return A=LRL⁻¹.

Generating a random binary matrix of size 8N_(bytes)×8N_(bytes) with the property that when acting on an N_(bytes)-times repeated sequence of 8 bits it results in the all-zero bit sequence.

1. Let the matrix A be the zero matrix of size 8×8.

2. Execute Steps 2-8 of the algorithm in Section 4.2.

The following numbered clauses include embodiments that are contemplated and nonlimiting:

-   1. An electronic cryptographic device arranged to perform a     cryptographic operation on input data obtaining output data, the     cryptographic device comprising     -   an input interface arranged to receive the input data,     -   a memory arranged to store an internal state, the internal state         comprising one or more data elements, each data element being         represented in the memory as a corresponding set of shares, a         set of shares in the memory having a corresponding set of         Fourier coefficients according to a discrete Fourier transform         in a finite field, the sets of Fourier coefficients         corresponding to the sets of shares in the memory satisfying a         predetermined relationship among them,     -   a processor circuit configured to         -   perform the cryptographic operation by repeatedly updating             the internal state, an initial internal state being derived             from the input data, the output data being derived from a             final internal state, updating the internal state being             arranged so that an updated set of Fourier coefficients             corresponding to the share sets of the updated internal             state satisfies the predetermined relationship among them as             an invariant,         -   apply an output operator to the final internal state to             derive the output data, the output operator mapping a set of             shares to the data element it represents plus a distortion,             said distortion depending on the Fourier coefficients of the             set of shares such that the distortion is zero if the             Fourier coefficients satisfy the predetermined relationship. -   2. A cryptographic device as in Clause 1, wherein a set of shares     represents a data element which is determined by a subset of the     Fourier coefficients corresponding to said set of shares.

3. A cryptographic device as in Clause 1 or 2, wherein a set of shares represents a data element which is equal to one of the Fourier coefficients corresponding to said set of shares.

-   4. A cryptographic device as in any one of the preceding clauses,     wherein the predetermined relationship comprises that at least two     Fourier coefficients of different sets of Fourier coefficients are     equal. -   5. A cryptographic device as in Clause 4, wherein each Fourier     coefficient in a set of Fourier coefficients, except one, is equal     to a respective Fourier coefficient in the other sets of Fourier     coefficients. -   6. An electronic cryptographic device as in any one of the preceding     clauses, wherein updating the internal state comprises applying     non-linear operations to the data elements of the internal state, a     non-linear operation being arranged to act on a data element of the     internal state by acting on shares in the memory in the     corresponding set of shares that represents the data element. -   7. A cryptographic device as in Clause 6, wherein the non-linear     operation is a polynomial in the finite field, the processor circuit     being arranged to computed powers of a shares set as convolutions of     the share set with itself -   8. An electronic cryptographic device as in any one of the preceding     clauses, wherein updating the internal state comprises applying     linear operations to the internal state, the linear operating     simultaneously on at least two sets of shares in the memory     representing at least two data elements of the internal state. -   9. A cryptographic device as in Clause 8, wherein the linear     operation is constructed by concatenating     -   a Fourier operator producing a set of Fourier coefficients for         each set of shares on which the linear operation acts, the sets         of Fourier coefficients being ordered with coefficients in the         set having an index,     -   one or more linear operators acting on Fourier coefficients of         the same index independent of Fourier coefficients of a         different index, the one or more linear operators being arranged         to act on Fourier coefficients preserving the invariant,     -   an inverse Fourier operator. -   10. A cryptographic device as in any one of the preceding clauses,     wherein performing the cryptographic operation comprising adding a     key to all or part of the internal state, said key being represented     in the memory as a corresponding set of shares, the set of shares     satisfying the predetermined relationship between the Fourier     coefficients corresponding to the set of shares of the key according     to the discrete Fourier transform in the finite field. -   11. A cryptographic device as in any one of the preceding clauses,     wherein the combined bit size of a set of shares is at least as     large as the bit-size of the input data. -   12. A cryptographic device as in any one of the preceding clauses,     wherein the cryptographic operation is a block cipher. -   13. A cryptographic device as in any one of the preceding clauses,     wherein the shares in a set of shares representing a data element     are encoded with linear encodings. -   14. A cryptographic device as in any one of the preceding clauses,     wherein the processor circuit is arranged to apply an input operator     to plain input data, said input operator producing multiple sets of     shares representing the initial internal state, the multiple sets of     shares satisfying the predetermined relationship. -   15. An electronic cryptographic method (500) to perform a     cryptographic operation on input data obtaining output data, the     cryptographic method comprising     -   receiving (510) the input data,     -   storing (530) an internal state, the internal state comprising         one or more data elements, each data element being represented         in the memory as a corresponding set of shares, a set of shares         in the memory having a corresponding set of Fourier coefficients         according to a discrete Fourier transform in a finite field, the         sets of Fourier coefficients corresponding to the sets of shares         in the memory satisfying a predetermined relationship among         them,     -   performing (541, 546) the cryptographic operation by repeatedly         updating the internal state, an initial internal state being         derived from the input data, the output data being derived from         a final internal state, updating the internal state being         arranged so that an updated set of Fourier coefficients         corresponding to the share sets of the updated internal state         satisfies the predetermined relationship among them as an         invariant,     -   apply (522) an output operator to the final internal state to         derive the output data, the output operator mapping a set of         shares to the data element it represents plus a distortion, said         distortion depending on the Fourier coefficients of the set of         shares such that the distortion is zero if the Fourier         coefficients satisfy the predetermined relationship. -   16. A computer readable medium (1000) comprising transitory or     non-transitory data (1020) representing instructions to cause a     processor system to perform the method according to clause 15.

Below further detailed embodiments are given of a cryptographic primitive implemented in a cryptographic device or method according to the invention. The chosen cryptographic primitive again is the AES block cipher, chosen as an illustration. The description below is for the encryption operation, however the decryption operation follows straightforwardly. The embodiments shown in detail below represent an entire AES internal state in a single set of shares. Furthermore, various advantages of representing more than data element of an internal state in the set of shares are discussed.

This embodiment deals with two independent problems. Firstly, Higher Order Masking as a countermeasure against White-box or Grey-box attacks comes with a significant price in complexity and consequently runtime and/or storage. There is a risk that an implementation of an algorithm wherein each encoding contains two independent variables, herein referred as ω, σ, may be attacked by a decomposition attack. These two problems are further addressed in the embodiments below.

As discussed herein, in order to thwart a share reduction attack, one may add an invariant on top of the shares based on the Fourier Transform. For example, let s=s₀, . . . , s₁₅ denote the AES state in a certain round. Each s_(i) may be represented by 17 shares, say x^(i)=x₀ ^(i), . . . , x₁₆ ^(i). Such that the zero-th Fourier Coefficient of x^(i)=s_(i), the state-byte. The other 16 Fourier Coefficients may be used to define the invariant. The invariant could be chosen to be bijective to the whole input (mitigating MIA). The invariant may be used to mitigate both the share reduction attack and DFA.

Next to DFA and MIA, also decomposition attacks are a threat in table-driven implementations where two algorithms are executed in parallel under a single joint encoding. For an example of decomposition see (included herein by reference): A. Biryukov and A. Shamir.: Structural cryptanalysis of SASAS. The two parts on which the two algorithms are executed are denoted by ω and σ. The usage of these joint encodings is two-fold: firstly, it thwarts an attacker that tries to reverse engineer tables, since a table now consists of multiple operations. Secondly, by tying these paths together, we obtain protection against MIA and DFA.

It is however a problem if a decomposition attack could be launched to separate the ω and σ paths. Indeed, a table involving non-linear operations on both an ω-unit and a σ-unit will be decomposed into two tables corresponding to a single operation, which depends on either ω or σ, hence the security offered by joining ω and σ is broken. Joint encoding as discussed below helps against: decomposition attacks on tables in implementations where parallel algorithms are jointly encoded, revealing branching and linear recombination in parallel algorithm executions, and reduces time and memory complexity.

This idea can be expressed as follows, let ƒ: {0,1}^(2n)→{0,1}^(2n), where ƒ(x)=ƒ₁₀₇ (ω(x))∥ƒ_(σ)(σ(x)) for some ƒ_(ω) and ƒ_(σ) operating over n-bits and where ω(·) extracts the “ω-part of x” and σ(·) extracts the “σ-part of x”. Let a>2 be a divisor of 2^(n)−1.

Let p_(ω)(u)=τ_(i=0) ² ^(n) ⁻¹ c_(i) ^(ω)u^(i) denote the polynomial representation of ƒ_(ω) and p_(σ)(u)=Σ_(i=0) ² ^(n) ⁻¹ c_(i) ^(σ)u^(i) the polynomial representation of ƒ_(σ). Given powers u=u⁰, . . . u² ^(n) ⁻¹, the remainder of the computation of ƒ_(ω) is in the inner-product between c^(ω)=c₀ ^(ω), . . . , c₂ _(n) ⁻¹ ^(ω) and u, which is linear given c^(ω).

Pick positions 0≤i_(ω)<a and 0≤i_(σ)<a such that i_(ω)≠i_(σ). Create a shares for x such that the i_(ω)'th Fourier Coefficient equals ω(x) the i_(σ)'th Fourier Coefficient contains σ(x) respectively.

Using a convolution network all required powers of ω(x) and σ(x) can be computed. By applying a linear transformation matrix representing the coefficients of the polynomials ({c_(i) ^(ω)}_(i) and {c_(i) ^(σ)}_(i)) on the results one can evaluate the two polynomials.

Branching and linear recombination can be represented as the following operations:

-   -   copy current state into multiple states,     -   run separate threads of the algorithm in all copies,     -   pick a linear map ƒ with the property that ƒ(x₁, . . . ,         x_(n))=x₁ if and only if x₁=x₂= . . . =x_(n)     -   apply ƒ on the result of all branches.

Note that copying can be implemented as copying the value of one Fourier Coefficient in another, which is linear. Also, applying ƒ is by construction linear. So, these two steps can be applied by putting them in a linear transformation matrix properly hiding these operations. Finally, evaluating all threads in parallel on the Fourier Coefficients can be done by ensuring that the affine operations are the same on each thread.

The inversion part of the S-box computes an inverse of all Fourier Coefficients. The affine part of AES can be implemented to act on Fourier Coefficients as well. That is: adding keys, values of different Fourier Coefficients to each other can be embedded in one Affine Transformation. Hence, one could implement AES as follows:

-   -   Introduction: copy the input to the first 16 Four Coefficients         of the share set (requires at least 17 shares)     -   Implement ShareSbox, e.g., as described above     -   Implement Key, e.g., as described above     -   Implement Linear Transformation L_(i) such that ShiftRows and         MixColumns are applied to the corresponding Fourier Coefficients     -   Reconstruction: ciphertext is represented by the first 16         Fourier Coefficients of the result.

With respect to MIA: because of Fourier Transform all shares are required to recover one AES-state byte and each set of shares in the program depends by construction on all input bytes. With respect to DFA: introducing one Fault to one byte, all Fourier Coefficients are touched because of the Fourier Transform. A successful fault injection requires that only one of the first 16 Fourier Coefficients is touched. One can show that this requires an attacker to hit at least 9 shares in the correct way.

Compared to the above implementation on 16*17 shares, this embodiment with just 17 shares and linear encodings has weaker MIA protection. This is because a MIA attack exists checking affinity of some intermediate value, e.g., the share set, representing the result of the first round S-box. This attack may be thwarted though by having a random input-dependent offset to the affine encoding of a share set, e.g., obtained by the Fourier Coefficient not used to compute AES-state bytes. In this approach on 17 shares we have only one non-representing coefficient left.

On the other hand, in a further embodiment one could use 51 shares instead of 17 to describe a full AES state, which will resolve this weakness. Compared to a 16*17 byte representation, still a gain in performance is obtained. For each convolution: the former requires 16*17² multiplications, while an implementation on 51 shares needs only 51²=9*17² multiplications. Moreover, the Linear Transformations in the 16*17 byte representation require matrices comprising 16²*17² bytes, compared to 512=32*17² bytes for the implementation with 51 shares.

As yet a further alternative, one could use non-linear encodings on 17 shares to resolve this weakness. In this case the relatively simple matrix multiplications may be replaced, e.g., with a circuit of table lookups.

We will describe an example implementation for AES, where each set of 51 shares corresponds to two AES states. So, two AES branches are combined in a single set of 51 shares.

Let p₀, . . . , p₁₅ denote the plaintext and c₀, . . . , c₁₅ the final ciphertext. Let bin: GF(256)→{0,1}⁸×{0,1}⁸ denote a function that transforms a field element β into the matrix corresponding to multiplication with β. That is, we fix a basis α₀, . . . , α₇ for GF(256). For (x₀, x₁, . . . , x₇)∈{0,1}⁸, we have that βΣ_(i=0) ⁷x_(i)α_(i)=Σ_(i=0) ⁷y_(i)α_(i) where (y₀, . . . y₇)=(x₀, . . . , x₇)bin(β). Furthermore, let α be an 51-th primitive root of the AES's finite field. Let F: {0,1}⁴⁰⁸×{0,1}⁴⁰⁸ denote the binary matrix corresponding to the Fourier Transform:

$F = {\begin{pmatrix} {{bin}(1)} & {{bin}(1)} & \cdots & {{bin}(1)} \\ {{bin}(1)} & {{bin}(\alpha)} & \cdots & {{bin}\left( \alpha^{50} \right)} \\ \vdots & \vdots & \; & \vdots \\ {{bin}(1)} & {{bin}\left( \alpha^{i} \right)} & \cdots & {{bin}\left( \alpha^{50i} \right)} \\ \vdots & \vdots & \; & \vdots \\ {{bin}(1)} & {{bin}\left( \alpha^{50} \right)} & \cdots & {{bin}(\alpha)} \end{pmatrix}.}$

The dimension of F is 408 since this is 51*8; this matrix acts on the bits of a 51-byte set of shares. Furthermore, Id denotes the 128×128 bit identity matrix and the linear transformation of the S-box acting on all state bytes is represented by the 128×128 bit matrix L_(s) and the 128-bit S-box offset to all state bytes is denoted by b_(s). with 0 we denote the 128-bit all zero vector. We denote by M the 128×128 bit matrix representing AES's ShiftRows and MixColumns, and with MC the 128×128 bit matrix representing MixColumns.

STEP 1: Choose a circuit. We will implement two AES branches, having the following structure:

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20 ω D₀ D₀ ⁻¹ R₀ R₁ R₂ R₃ R₄ R₅ R₆ R₇ R₈ R₉ R₁₀ R₁₁ R₁₂ D₃ D₃ ⁻¹ R₁₂ ⁻¹ R₁₁ ⁻¹ MC⁻¹ σ D₁ D₂ D₂ ⁻¹ D₁ ⁻¹ R₀ R₁ R₂ R₃ R₄ R₅ R₆ R₇ R₈ R₉ R₁₀ R₁₁ R₁₂ D₄ D₅ MC⁻¹

In the table above, the first row contains the round numbers. The second and third row refer to the two branches of AES. Note that this implementation of AES uses 20 rounds due to the addition of dummy rounds: D₀-D₅, R₁₁-R₁₂. The results at the end of round 16 for the two branches of AES should be equal. This equality is verified by introducing a distortion in case the two branches are not equal. For example, this may be done in the affine part of round 17. For the dummy rounds, one could use a regular AES round except with different keys, e.g., random keys.

STEP 2: Choose random Encodings.

1. Choose 20*51 invertible matrices of size 8×8 bits, say E_(i,j) for i=0, . . . , 19 and j=0, . . . , 50.

2. Define E_(i)=diag (E_(i,0), . . . , E_(i,19)), for i=0, . . . , 19.

3. D_(i)=E_(i) ⁻¹.

STEP 3: Create Input Transformation.

1. For i=0, . . . , 18 choose random linear mappings U_(i): {0,1}¹²⁸→{0,1}⁸.

2. Define I_(j) the 8×128 matrix corresponding to I_(j)(bin(x₀), . . . , bin(x₁₅))=bin(x_(j)).

3. Define

$L_{I} = \begin{pmatrix} I_{0} \\ \begin{matrix} \vdots \\ \begin{matrix} I_{15} \\ \begin{matrix} U_{0} \\ \begin{matrix} \vdots \\ \begin{matrix} U_{18} \\ \begin{matrix} I_{0} \\ \begin{matrix} \vdots \\ I_{15} \end{matrix} \end{matrix} \end{matrix} \end{matrix} \end{matrix} \end{matrix} \end{matrix} \end{pmatrix}$

STEP 4: Create Dummy Round Transformations and Keys

1. For j=0, . . . , 5:

-   -   generate an 128×128 random invertible binary matrix L_(D) _(i) .     -   generate a 128 bit random binary vector K_(D) _(i) .

STEP 5: Create Round Keys

1. given 128 bit key K, compute the Round keys K′₀=K, . . . , K′₁₀ following AES's key schedule.

2. For i=0, . . . 9 let K_(i)=K′_(i) and let K₁₀=MC*K′₁₀. (our “final AES round” will have a mixcolumns)

3. generate two random 128 bit keys K₁₁ and K₁₂.

STEP 6: Create Round Affine mappings

1. Let A_(i): {0,1}⁴⁰⁸→{0,1}⁴⁰⁸ be defined by A₁(x)=L_(i)(x)+b_(i) for i=0, . . . , 19.

2. Round 0:

-   -   Generate random 152 bit v₀ and a random 152×152 binary matrix V₀     -   Compute L′₀=diag (L_(D) ₀ ,V₀,L_(D1)).     -   Compute b′₀=(K_(D) ₀ ,v₀,K_(D) ₁ ).     -   Compute L₀=E₀*F*L′₀*L₁,     -   and b₀=E₀*F*b′₀.

Note that v₀ is 152 bits since 51−2*16=19, and 19*8=152. The L_(D) ₀ represents the ω AES branch, the L_(D) ₁ represents the σ AES branch and the V₀ represents the remaining coefficients.

3. Round 1:

-   -   Generate random 152 bit v₁ and a random 152×152 binary matrix         V₁.     -   Compute L′₁=diag (Id,V₁,L_(D) ₂ ).     -   Compute b′₁=(0,v₁,K_(D) ₂ ).     -   Compute L₁=E₁*F*L′₁*F⁻¹*E₀ ⁻¹,     -   and b₁=E₁*F*b′₁.

4. Round 2:

-   -   Generate random 152 bit v₂ and a random 152×152 binary matrix         V₂.     -   Compute L′₂=diag (L_(D) ₀ ⁻¹,V₂,Id).     -   Compute b′₂=(L_(D) ₀ ⁻¹K_(D) ₀ +K₀,v₂,0).     -   Compute L₂=E₂*F*L′₂*F⁻¹*E₁ ⁻¹,     -   and b₂=E₂*F*b′₂.

5. Round 3:

-   -   Generate random 152 bit v₃ and a random 152×152 binary matrix         V₃.     -   Compute L′₃=diag (M*L_(S),V₃,L_(D) ₂ ⁻¹).     -   Compute b′₃=(K₁M*b_(S),v₃,L_(D) ₂ ⁻¹K_(D) ₂ ).     -   Compute L₃=E₃*F*L′₃*F⁻¹*E₂ ⁻¹,     -   and b₃=E₃*F*b′₃.

6. Round 4:

-   -   Generate random 152 bit v₄ and a random 152×152 binary matrix         V₄.     -   Compute L′₄=diag (M*L_(S),V₄,L_(D) ₁ ⁻¹).     -   Compute b′₄=(K₂M*b_(s),v₄,L_(D) ₁ ⁻¹K_(D) ₁ +K₀).     -   Compute L₄=E₄*F*L′₄*F⁻¹*E₂ ⁻¹,     -   and b₄=E₄*F*b′₄.

7. Round i=5, . . . , 14:

-   -   Generate random 152 bit v_(i) and a random 152×152 binary matrix         V_(i).     -   Compute L′_(i)=diag (M*L_(S),V_(i),M*L_(S)).     -   Compute b′_(i)=(K_(i−2)+M*b_(s),v_(i),K_(i−4)+M*b_(S)).     -   Compute L_(i)=E_(i)*F*L′₄*F⁻¹*E_(i−1) ⁻¹,     -   and b_(i)=E_(i)*F*b′_(i).

8. Round 15:

-   -   Generate random 152 bit v₁₅ and a random 152×152 binary matrix         V₁₅.     -   Compute L′₁₅=diag (L_(D) ₃ ,V₁₅,M*L_(S)).     -   Compute b′₁₅=(K_(D) ₃ ,v₁₅,K₁₁+M*b_(S)).     -   Compute L₁₅=E₁₅*F*L′₁₅*F⁻¹*E₁₄ ⁻¹,     -   and b₁₅=E₁₅*F*b′₁₅.

9. Round 16:

-   -   Generate random 152 bit v₁₆ and a random 152×152 binary matrix         V₁₆.     -   Compute L′₁₆=diag (Id,V₁₆,M*L_(S)).     -   Compute b′₁₆=(0,v₁₆,K₁₂+M*b_(S)).     -   Compute L₁₆=E₁₆*F*L′₁₆*F⁻¹*E₁₅ ⁻¹,     -   and b₁₆=E₁₆*F*b′₁₆.

10. Round 17:

-   -   Generate random 152 bit v₁₇ and a random 152×152 binary matrix         V₁₇.     -   Generate random 128×128 bit matrix binary B, such that both B         and B+Id are invertible.

${\text{-}\mspace{11mu}{Compute}\mspace{14mu} C} = {\begin{pmatrix} B & 0 & {B + {Id}} \\ 0 & {Id} & 0 \\ 0 & 0 & {Id} \end{pmatrix}.}$

-   -   Compute L′₁₇=diag (Id,V₁₇,L_(D) ₄ )*C*diag (L_(D) ₃ ⁻¹,Id,Id).     -   Compute b′₁₇=(B*L_(D) ₃ ⁻¹K_(D) ₃ ,v₁₇,K_(D) ₄ ).     -   Compute L₁₇=E₁₇*F*L′₁₇*F⁻¹*E₁₆ ⁻¹,     -   and b₁₇=E₁₇*F*b′₁₇.

11. Round 18:

-   -   Generate random 152 bit v₁₈ and a random 152×152 binary matrix         V₁₈.     -   Compute L′₁₈=diag (L_(S) ⁻¹*M⁻¹,V₁₈,L_(D) ₅ ).     -   Compute b′₁₈=(L_(S) ⁻¹*M⁻¹*K₁₂+L_(S) ⁻¹*b_(S),v₁₈,K_(D) ₅ ).     -   Compute L₁₈=E₁₈*F*L′₁₈*F⁻¹*E₁₇ ⁻¹,     -   and b₁₈=E₁₈*F*b′₁₈.

12. Round 19:

-   -   Generate random 152 bit v₁₉ and a random 152×152 binary matrix         V₁₉.     -   Compute L′₁₉=diag (MC⁻¹*L_(S) ⁻¹*M⁻¹,V₁₉,Id).     -   Compute 128 bit b′₁₉=(MC⁻¹*L_(S) ⁻¹*M⁻¹*K₁₁+L_(S) ⁻¹*b_(S)).     -   Compute 128×408 bit L₁₉=(Id 0 0)*L′₁₉*F⁻¹*E₁₈ ⁻¹,     -   and b₁₉=b′₁₉.

STEP 7: Completing the circuit We apply the “inversion” function used in “ShareSbox” described above to compute multiplicative inverses over GF(256) of each Fourier Coefficient. We call this function S here. Then, the final circuit is described as follows:

-   -   Given 128 bit plaintext p.     -   Set x₀=S∘A₀(p)     -   For i=1, . . . 18: x_(i)=S∘A_(i)(x_(i−1)).     -   The 128 bit result c=A₁₉(x).

In the various embodiments of the cryptographic device, the input interface may be selected from various alternatives. For example, input interface may be a network interface to a local or wide area network, e.g., the Internet, a storage interface to an internal or external data storage, a keyboard, an application interface (API), etc. The output interface may be a network interface to a local or wide area network, e.g., the Internet, a storage interface to an internal or external data storage, an application interface (API), a display, a printer, etc. The input and output interfaces may be combined in a communication interface.

The cryptographic device may have a user interface, which may include well-known elements such as one or more buttons, a keyboard, display, touch screen, etc. The user interface may be arranged for accommodating user interaction for performing a cryptographic action, say a decryption.

Memory of device 100, e.g., internal state storage 130, may be implemented as an electronic memory, say a flash memory, or a RAM, or magnetic memory, say hard disk or the like. Storage 130 may comprise multiple discrete memories together making up the memory. The memory may be part volatile, part non-volatile. For example, tables, and computer instructions may be stored in the non-volatile part, and internal states in the volatile part.

Typically, the device 100 comprise a microprocessor (not separately shown in FIG. 1) which executes appropriate software stored at the device 100; for example, that software may have been downloaded and/or stored in a corresponding memory, e.g., a volatile memory such as RAM or a non-volatile memory such as Flash (not separately shown). Alternatively, device 100 may, in whole or in part, be implemented in programmable logic, e.g., as field-programmable gate array (FPGA). Device 100 may be implemented, in whole or in part, as a so-called application-specific integrated circuit (ASIC), e.g., an integrated circuit (IC) customized for their particular use. For example, the circuits may be implemented in CMOS, e.g., using a hardware description language such as Verilog, VHDL etc.

In an embodiment, device 100 comprises one or more or all of: an input interface circuit, an input operator circuit, an output interface circuit, an output operator circuit, an internal state storage circuit, multiple non-linear operation circuits, multiple linear operation circuits. The device 100 may comprise additional circuits. The circuits implement the corresponding units described herein. The circuits may be a processor circuit and storage circuit, the processor circuit executing instructions represented electronically in the storage circuits. The circuits may also be, FPGA, ASIC or the like.

A processor circuit may be implemented in a distributed fashion, e.g., as multiple sub-processor circuits. A storage may be distributed over multiple distributed sub-storages. Part or all of the memory may be an electronic memory, magnetic memory, etc. For example, the storage may have volatile and a non-volatile part. Part of the storage may be read-only.

FIG. 5a schematically shows an example of an embodiment of a cryptographic method 501. Method 501 is arranged to perform a cryptographic operation on input data obtaining output data. Cryptographic method 501 comprises

-   -   receiving the input data 560,     -   storing 570 an internal state, the internal state comprising one         or more data elements, the internal state being represented in         the memory as one or more sets of shares, a set of shares in the         memory having a corresponding set of Fourier coefficients         according to a discrete Fourier transform in a finite field, a         proper subset of the Fourier coefficients corresponding to a set         of shares determining one or more data elements of the internal         state,     -   performing the cryptographic operation by repeatedly updating         580 the internal state, an initial internal state being derived         from the input data, the output data being derived from a final         internal state, an updated internal state being formed by         updating the one or more sets of shares representing the         internal state, a proper subset of the updated Fourier         coefficients corresponding to an updated set of shares         determining the one or more updated data elements of the updated         internal state,     -   applying 590 an output operator to the final internal state to         derive the output data, the output operator mapping the one or         more sets of shares to the data elements of the output data.

FIG. 5b schematically shows an example of an embodiment of a cryptographic method 500. Method 500 is arranged to perform a cryptographic operation on input data obtaining output data. Method 500 comprises

-   -   receiving 510 the input data,     -   applying 512 an input operator to plain input data, said input         operator producing multiple sets of shares representing the         initial internal state, the multiple sets of shares satisfying         the predetermined relationship,     -   storing 530 an internal state, the internal state comprising one         or more data elements, each data element being represented in         the memory as a corresponding set of shares, a set of shares in         the memory having a corresponding set of Fourier coefficients         according to a discrete Fourier transform in a finite field, the         sets of Fourier coefficients corresponding to the sets of shares         in the memory satisfying a predetermined relationship among         them,     -   repeatedly updating the internal state, updating the internal         state being arranged so that an updated set of Fourier         coefficients corresponding to the share sets of the updated         internal state satisfies the predetermined relationship among         them as an invariant, the updating comprises applying 551 one or         more linear operators and/or one or more non-linear operators         546, after the operators are applied the updated internal state         is stored again in 530     -   applying 522 an output operator to the final internal state to         derive the output data, the output operator mapping a set of         shares to the data element it represents plus a distortion, said         distortion depending on the Fourier coefficients of the set of         shares such that the distortion is zero if the Fourier         coefficients satisfy the predetermined relationship, For         example, the output operator may be applied after a         predetermined number of updating rounds have been executed in         the internal state, and     -   outputting 520 the output data.

As noted herein, some of the steps in the method are optional; for example, encoding the input data is not needed if it is already encoded.

Many different ways of executing the method are possible, as will be apparent to a person skilled in the art. For example, the order of the steps can be varied or some steps may be executed in parallel. Moreover, in between steps other method steps may be inserted. The inserted steps may represent refinements of the method such as described herein, or may be unrelated to the method. For example, updating steps may be executed, at least partially, in parallel; for example, applying non-linear operators to different data elements of the internal state may be done in parallel. Moreover, a given step may not have finished completely before a next step is started.

A method according to the invention may be executed using software, which comprises instructions for causing a processor system to perform an embodiment of a cryptographic method, e.g., method 500 or 501. Software may only include those steps taken by a particular sub-entity of the system. The software may be stored in a suitable storage medium, such as a hard disk, a floppy, a memory, an optical disc, etc. The software may be sent as a signal along a wire, or wireless, or using a data network, e.g., the Internet. The software may be made available for download and/or for remote usage on a server. A method according to the invention may be executed using a bitstream arranged to configure programmable logic, e.g., a field-programmable gate array (FPGA), to perform the method.

It will be appreciated that the invention also extends to computer programs, particularly computer programs on or in a carrier, adapted for putting the invention into practice. The program may be in the form of source code, object code, a code intermediate source, and object code such as partially compiled form, or in any other form suitable for use in the implementation of the method according to the invention. An embodiment relating to a computer program product comprises computer executable instructions corresponding to each of the processing steps of at least one of the methods set forth. These instructions may be subdivided into subroutines and/or be stored in one or more files that may be linked statically or dynamically. Another embodiment relating to a computer program product comprises computer executable instructions corresponding to each of the means of at least one of the systems and/or products set forth.

FIG. 6a shows a computer readable medium 1000 having a writable part 1010 comprising a computer program 1020, the computer program 1020 comprising instructions for causing a processor system to perform a cryptographic method, according to an embodiment. The computer program 1020 may be embodied on the computer readable medium 1000 as physical marks or by means of magnetization of the computer readable medium 1000. However, any other suitable embodiment is conceivable as well. Furthermore, it will be appreciated that, although the computer readable medium 1000 is shown here as an optical disc, the computer readable medium 1000 may be any suitable computer readable medium, such as a hard disk, solid state memory, flash memory, etc., and may be non-recordable or recordable. The computer program 1020 comprises instructions for causing a processor system to perform said cryptographic method.

FIG. 6b shows in a schematic representation of a processor system 1140 according to an embodiment of a cryptographic device. The processor system comprises one or more integrated circuits 1110. The architecture of the one or more integrated circuits 1110 is schematically shown in FIG. 6b . Circuit 1110 comprises a processing unit 1120, e.g., a CPU, for running computer program components to execute a method according to an embodiment and/or implement its modules or units. Circuit 1110 comprises a memory 1122 for storing programming code, data, etc. Part of memory 1122 may be read-only. Circuit 1110 may comprise a communication element 1126, e.g., an antenna, connectors or both, and the like. Circuit 1110 may comprise a dedicated integrated circuit 1124 for performing part or all of the processing defined in the method. Processor 1120, memory 1122, dedicated IC 1124 and communication element 1126 may be connected to each other via an interconnect 1130, say a bus. The processor system 1110 may be arranged for contact and/or contact-less communication, using an antenna and/or connectors, respectively.

For example, in an embodiment, the cryptographic device may comprise a processor circuit and a memory circuit, the processor being arranged to execute software stored in the memory circuit. For example, the processor circuit may be an Intel Core i7 processor, ARM Cortex-R8, etc. In an embodiment. The memory circuit may include a ROM circuit, or a non-volatile memory, e.g., a flash memory. The memory circuit may be a volatile memory, e.g., an SRAM memory. In the latter case, the device may comprise a non-volatile software interface, e.g., a hard drive, a network interface, etc., arranged for providing the software.

It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design many alternative embodiments.

In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. Use of the verb “comprise” and its conjugations does not exclude the presence of elements or steps other than those stated in a claim. The article “a” or “an” preceding an element does not exclude the presence of a plurality of such elements. The invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the device claim enumerating several means, several of these means may be embodied by one and the same item of hardware. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage.

In the claims references in parentheses refer to reference signs in drawings of exemplifying embodiments or to formulas of embodiments, thus increasing the intelligibility of the claim. These references shall not be construed as limiting the claim.

LIST OF REFERENCE NUMERALS, IN FIG. 1-3 b

-   100 a cryptographic device -   110 an input interface -   112 an input operator -   120 an output interface -   122 an output operator -   130 an internal state storage -   141, 142, 143 a non-linear operation -   146, 147, 148 a linear operation -   210 plain input data -   211, 212, 213, 214 an internal state -   215 plain output data -   310 a plain internal state -   311, 312, 313 a data element -   320 an internal state represented as a set of shares (unencoded) -   321, 322, 323 a set of shares -   330 Fourier coefficients for an internal state -   331, 332, 333 a set of Fourier coefficients -   340 an internal state represented as a set of shares (encoded) -   341, 342, 343 a set of encoded shares 

The invention claimed is:
 1. A cryptographic device comprising an input interface circuit, wherein the input interface circuit is arranged to receive an input data, a memory circuit, wherein the memory circuit is arranged to store an internal state, wherein the internal state comprises at least one data element, wherein the internal state is represented in the memory as at least one set of shares, wherein a portion of the at least one set of shares has at least one corresponding set of Fourier coefficients, wherein the at least one set of Fourier coefficients are arranged as a discrete Fourier transform in a finite field, wherein a proper subset of the at least one set of Fourier coefficients determines the at least one data element, a processor circuit, wherein the processor circuit is arranged to perform a cryptographic operation by repeatedly updating the internal state, wherein an initial internal state is derived from the input data, wherein an output data is derived from a final internal state, wherein an updated internal state is formed by updating the at least one set of shares, wherein a portion of the at least one of the at least one updated set of shares has at least one updated set of Fourier coefficients, wherein a proper subset of the updated set of Fourier coefficients, determines at least one updated data element of the updated internal state, wherein the processor circuit is arranged to apply an output operator to a final internal state so as to derive the output data, wherein the output operator maps the at least one set of shares to the data elements of the output data.
 2. The cryptographic device as in claim 1, wherein the at least one set of Fourier coefficients comprises at least one coefficient, wherein the at least one coefficient represents a single data element of the internal state.
 3. The cryptographic device as in claim 1, wherein the at least one set of Fourier coefficients comprises both at least one representing element and at least one error-detecting element, wherein the at least one or more representing elements determine at least one data element of the internal state, wherein the at least one error-detecting element comprise redundant data, wherein the redundant data is arranged to detect tampering of the set of shares.
 4. The cryptographic device as in claim 1, wherein at least one-coefficient in the at least one sett of Fourier coefficients are error-detecting elements, wherein the at least one error-detecting element satisfies a predetermined relationship, wherein the predetermined relationship is between the at least one error-detecting element, wherein the updating of the internal state maintains the predetermined relationship, wherein the updating of the at least one set of shares and/or the output operator comprise a distortion, wherein the distortion depends on the at least one-error-detecting coefficient, wherein the distortion leaves the output of the updating and/or output operator unaffected if the at least one error-detecting Fourier coefficient satisfy the predetermined relationship.
 5. The cryptographic device as in claim 1, wherein a proper subset of the least one set of Fourier coefficients determines at least two data elements of the internal state.
 6. The cryptographic device as in claim 1, wherein a proper subset of the least one set of Fourier coefficients determines the entire internal state.
 7. The cryptographic device as in claim 1, wherein updating the internal state comprises applying at least one non-linear operation to the data elements of the internal state, wherein the at least one non-linear operation is arranged to act on a data element of the internal state by acting on a portion of the at least one set of shares in the memory, wherein the portion of the at least on set of share in the memory correspond to the portion of the at least one set of shares that represents the data element.
 8. The cryptographic device as in claim 7, wherein the non-linear operation is a polynomial in the finite field, wherein the processor circuit is arranged to compute powers of at least one of the at least one set of shares as a convolution with itself.
 9. The cryptographic device as in claim 1, wherein updating the internal state comprises applying at least one linear operation to the internal state, wherein the linear operation is performed on at least one of the set of shares.
 10. The cryptographic device as in claim 9, wherein the linear operation is constructed by concatenating: a set of Fourier coefficients for each of the at least one set of shares on which the linear operation is performed, wherein the set of Fourier coefficients is created by a Fourier operator; at least one linear operator acting on the Fourier coefficients; an inverse Fourier operator.
 11. The A cryptographic device as in claim 1, wherein the processor circuit is arranged to perform the cryptographic operation as an alternating sequence of an affine operation and an s-box layer (A_(m)∘S∘A_(m−1)∘S∘A_(m−2)∘S∘ . . . ∘S∘A₀).
 12. The cryptographic device as in claim 1, wherein performing the cryptographic operation comprise adding a key to all or part of the internal state, wherein the key is represented in the memory as a corresponding set of shares.
 13. The cryptographic device as in claim 1, wherein the cryptographic operation is a block cipher.
 14. The cryptographic device as in claim 1, wherein the shares in the at least one set of shares are encoded with linear encodings.
 15. A cryptographic device as in claim 1, wherein the processor circuit is arranged to apply an input operator to plain input data, wherein the input operator provides the at least one set of shares representing the initial internal state.
 16. An electronic cryptographic method comprising receiving an input data; storing an internal state wherein the internal state comprises at least one data element, wherein the internal state is represented in a memory as at least one set of shares, wherein a portion of the at least one set of shares has at least one corresponding set of Fourier coefficients, wherein the at least one set of Fourier coefficients are arranged as a discrete Fourier transform in a finite field, wherein a proper subset of the at least one set Fourier coefficients determines at east one data element; performing a cryptographic operation by repeatedly updating the internal state, wherein an initial internal state is derived from the input data, wherein an output data is derived from a final internal state, wherein an updated internal state is formed by updating the at least one set of shares, wherein a portion of the at least one of the at least one updated set of shares has at least one updated set of Fourier coefficients, wherein a proper subset of the updated set of Fourier coefficients determines at least one updated data element of the updated internal state; and applying an output operator to the final internal state to derive the output data, wherein the output operator maps the at least one set of shares to the data elements of the output data.
 17. The method as in claim 16, wherein the at least one set of Fourier coefficients comprises at least one coefficient, wherein the at least one coefficient represents a single data dement of the internal state.
 18. A method as in claim 16, wherein the at least one set of Fourier coefficients comprises both at least one representing element and at least one error-detecting element, wherein the at least one or more representing elements determine at least one data element of the internal state, wherein the at least one error-detecting element comprise redundant data, wherein the redundant data is arranged to detect tampering of the set of shares.
 19. The method as in claim 16, wherein at least one coefficient in the at least one set of Fourier coefficients are error-detecting element, wherein the at least one error-detecting element satisfies a predetermined relationship, wherein the predetermined relationship is between the at least one error-detecting element, wherein the updating of the internal state maintains the predetermined relationship, wherein the updating of the at least one set of shares and/or the output operator comprise a distortion, wherein the distortion depends on the at least one error-detecting coefficient, wherein the distortion leaves the output of the updating and/or output operator unaffected if the at least one error-detecting Fourier coefficient satisfy the predetermined relationship.
 20. A computer program stored on a non-transitory medium, wherein the computer program when executed on a processor performs the method as claimed in claim
 16. 